Base | Representation |
---|---|
bin | 1001001100000001101011… |
… | …0000100010000011100100 |
3 | 1022202202120112011100122020 |
4 | 2103000122300202003210 |
5 | 2311003312233311322 |
6 | 33252520411103140 |
7 | 2061601142163210 |
oct | 223003260420344 |
9 | 38682515140566 |
10 | 10102212010212 |
11 | 3245362352133 |
12 | 1171a62441ab0 |
13 | 58383301313a |
14 | 26cd41c75940 |
15 | 127bad46d05c |
hex | 9301ac220e4 |
10102212010212 has 48 divisors (see below), whose sum is σ = 27031174864512. Its totient is φ = 2876495270400.
The previous prime is 10102212010139. The next prime is 10102212010213. The reversal of 10102212010212 is 21201021220101.
It is a junction number, because it is equal to n+sod(n) for n = 10102212010191 and 10102212010200.
It is not an unprimeable number, because it can be changed into a prime (10102212010213) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 205204789 + ... + 205254012.
It is an arithmetic number, because the mean of its divisors is an integer number (563149476344).
Almost surely, 210102212010212 is an apocalyptic number.
10102212010212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10102212010212 is an abundant number, since it is smaller than the sum of its proper divisors (16928962854300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102212010212 is a wasteful number, since it uses less digits than its factorization.
10102212010212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410459108 (or 410459106 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10102212010212 its reverse (21201021220101), we get a palindrome (31303233230313).
The spelling of 10102212010212 in words is "ten trillion, one hundred two billion, two hundred twelve million, ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •