Base | Representation |
---|---|
bin | 101000000000000… |
… | …0110111011010100 |
3 | 10110112121010000110 |
4 | 1100000012323110 |
5 | 10222101040102 |
6 | 341104043020 |
7 | 45155363004 |
oct | 12000067324 |
9 | 3415533013 |
10 | 1342205652 |
11 | 629704a77 |
12 | 315603470 |
13 | 1850c4738 |
14 | ca38a004 |
15 | 7cc7a86c |
hex | 50006ed4 |
1342205652 has 12 divisors (see below), whose sum is σ = 3131813216. Its totient is φ = 447401880.
The previous prime is 1342205651. The next prime is 1342205653. The reversal of 1342205652 is 2565022431.
It is an interprime number because it is at equal distance from previous prime (1342205651) and next prime (1342205653).
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1342205651) 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 3 ways as a sum of consecutive naturals, for example, 55925224 + ... + 55925247.
Almost surely, 21342205652 is an apocalyptic number.
1342205652 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1342205652 is an abundant number, since it is smaller than the sum of its proper divisors (1789607564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1342205652 is a wasteful number, since it uses less digits than its factorization.
1342205652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111850478 (or 111850476 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
The square root of 1342205652 is about 36636.1249588436. The cubic root of 1342205652 is about 1103.0783337662.
The spelling of 1342205652 in words is "one billion, three hundred forty-two million, two hundred five thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.243 sec. • engine limits •