Base | Representation |
---|---|
bin | 10001101000111101011… |
… | …101110101110011100010 |
3 | 11021212221010202111122220 |
4 | 101220331131311303202 |
5 | 124330102233311320 |
6 | 2324514342211510 |
7 | 153402513035235 |
oct | 21507535656342 |
9 | 4255833674586 |
10 | 1212212010210 |
11 | 428107094113 |
12 | 176b27423b96 |
13 | 8a407650356 |
14 | 4295837341c |
15 | 217ebd88e40 |
hex | 11a3d775ce2 |
1212212010210 has 32 divisors (see below), whose sum is σ = 2909352418560. Its totient is φ = 323251692288.
The previous prime is 1212212010203. The next prime is 1212212010241. The reversal of 1212212010210 is 120102122121.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1212212010210.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2026519 + ... + 2555621.
It is an arithmetic number, because the mean of its divisors is an integer number (90917263080).
Almost surely, 21212212010210 is an apocalyptic number.
1212212010210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1212212010210 is an abundant number, since it is smaller than the sum of its proper divisors (1697140408350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1212212010210 is a wasteful number, since it uses less digits than its factorization.
1212212010210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 605482.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1212212010210 its reverse (120102122121), we get a palindrome (1332314132331).
The spelling of 1212212010210 in words is "one trillion, two hundred twelve billion, two hundred twelve million, ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •