Base | Representation |
---|---|
bin | 101000000001110… |
… | …1001001001010001 |
3 | 10110121100012001120 |
4 | 1100003221021101 |
5 | 10222320212431 |
6 | 341135552453 |
7 | 45166302303 |
oct | 12003511121 |
9 | 3417305046 |
10 | 1343132241 |
11 | 62a188150 |
12 | 31598b729 |
13 | 18535a409 |
14 | ca54b973 |
15 | 7cdb0196 |
hex | 500e9251 |
1343132241 has 8 divisors (see below), whose sum is σ = 1953646944. Its totient is φ = 814019520.
The previous prime is 1343132233. The next prime is 1343132251. The reversal of 1343132241 is 1422313431.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1343132241 - 23 = 1343132233 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1343132251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20350456 + ... + 20350521.
It is an arithmetic number, because the mean of its divisors is an integer number (244205868).
Almost surely, 21343132241 is an apocalyptic number.
1343132241 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1343132241 is a deficient number, since it is larger than the sum of its proper divisors (610514703).
1343132241 is a wasteful number, since it uses less digits than its factorization.
1343132241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40700991.
The product of its digits is 1728, while the sum is 24.
The square root of 1343132241 is about 36648.7686150572. The cubic root of 1343132241 is about 1103.3321113542.
Adding to 1343132241 its reverse (1422313431), we get a palindrome (2765445672).
The spelling of 1343132241 in words is "one billion, three hundred forty-three million, one hundred thirty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •