Base | Representation |
---|---|
bin | 10111001111011000100010… |
… | …100001110100001011001100 |
3 | 111101220101120201121010200220 |
4 | 113033120202201310023030 |
5 | 101344121102004000022 |
6 | 1001215350321551340 |
7 | 30346405605321411 |
oct | 2717304241641314 |
9 | 441811521533626 |
10 | 102212211000012 |
11 | 2a627a56496203 |
12 | b5694b27a5550 |
13 | 450575479a079 |
14 | 1b35151408108 |
15 | bc3b92c7085c |
hex | 5cf6228742cc |
102212211000012 has 48 divisors (see below), whose sum is σ = 238640513126400. Its totient is φ = 34049975027200.
The previous prime is 102212210999959. The next prime is 102212211000071. The reversal of 102212211000012 is 210000112212201.
It is a junction number, because it is equal to n+sod(n) for n = 102212210999955 and 102212211000000.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 293580637 + ... + 293928587.
It is an arithmetic number, because the mean of its divisors is an integer number (4971677356800).
Almost surely, 2102212211000012 is an apocalyptic number.
102212211000012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102212211000012 is an abundant number, since it is smaller than the sum of its proper divisors (136428302126388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102212211000012 is a wasteful number, since it uses less digits than its factorization.
102212211000012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 362806 (or 362804 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102212211000012 its reverse (210000112212201), we get a palindrome (312212323212213).
The spelling of 102212211000012 in words is "one hundred two trillion, two hundred twelve billion, two hundred eleven million, twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •