Base | Representation |
---|---|
bin | 10111001100010011000001… |
… | …101000101001010111101110 |
3 | 111101011010011120112211202021 |
4 | 113030103001220221113232 |
5 | 101332132232243101220 |
6 | 1000534114101020354 |
7 | 30325160233513522 |
oct | 2714230150512756 |
9 | 441133146484667 |
10 | 102000132003310 |
11 | 2a556016418002 |
12 | b5343859b46ba |
13 | 44bb756b47888 |
14 | 1b28b93023d82 |
15 | bbd3ce1744aa |
hex | 5cc4c1a295ee |
102000132003310 has 16 divisors (see below), whose sum is σ = 191582856632736. Its totient is φ = 39026137462048.
The previous prime is 102000132003229. The next prime is 102000132003311. The reversal of 102000132003310 is 13300231000201.
It is a super-2 number, since 2×1020001320033102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102000132003311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 221739417169 + ... + 221739417628.
It is an arithmetic number, because the mean of its divisors is an integer number (11973928539546).
Almost surely, 2102000132003310 is an apocalyptic number.
102000132003310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102000132003310 is a deficient number, since it is larger than the sum of its proper divisors (89582724629426).
102000132003310 is a wasteful number, since it uses less digits than its factorization.
102000132003310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443478834827.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 102000132003310 its reverse (13300231000201), we get a palindrome (115300363003511).
The spelling of 102000132003310 in words is "one hundred two trillion, one hundred thirty-two million, three thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •