Base | Representation |
---|---|
bin | 10111001111011001010010… |
… | …001010111001110110101100 |
3 | 111101220110122102121210121110 |
4 | 113033121102022321312230 |
5 | 101344124221114102312 |
6 | 1001220001513432020 |
7 | 30346434452262141 |
oct | 2717312212716654 |
9 | 441813572553543 |
10 | 102213010300332 |
11 | 2a628326699388 |
12 | b56969640b610 |
13 | 4505851266639 |
14 | 1b351c96303c8 |
15 | bc3bdd00a43c |
hex | 5cf6522b9dac |
102213010300332 has 24 divisors (see below), whose sum is σ = 239091779716272. Its totient is φ = 33986038336000.
The previous prime is 102213010300319. The next prime is 102213010300343. The reversal of 102213010300332 is 233003010312201.
It is a junction number, because it is equal to n+sod(n) for n = 102213010300299 and 102213010300308.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10620632169 + ... + 10620641792.
It is an arithmetic number, because the mean of its divisors is an integer number (9962157488178).
Almost surely, 2102213010300332 is an apocalyptic number.
102213010300332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102213010300332 is an abundant number, since it is smaller than the sum of its proper divisors (136878769415940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102213010300332 is a wasteful number, since it uses less digits than its factorization.
102213010300332 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21241274369 (or 21241274367 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 102213010300332 its reverse (233003010312201), we get a palindrome (335216020612533).
The spelling of 102213010300332 in words is "one hundred two trillion, two hundred thirteen billion, ten million, three hundred thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •