Base | Representation |
---|---|
bin | 10111001110000010101010… |
… | …011101001010001010010100 |
3 | 111101120120120112110202212120 |
4 | 113032002222131022022110 |
5 | 101341113231030401322 |
6 | 1001105140435215540 |
7 | 30336632565415323 |
oct | 2716025235121224 |
9 | 441516515422776 |
10 | 102120002200212 |
11 | 2a5a1938a85137 |
12 | b55365a1475b0 |
13 | 44c9b4b184c79 |
14 | 1b308c501c0ba |
15 | bc1597a39a5c |
hex | 5ce0aa74a294 |
102120002200212 has 36 divisors (see below), whose sum is σ = 239048645081568. Its totient is φ = 33930546969200.
The previous prime is 102120002200193. The next prime is 102120002200213. The reversal of 102120002200212 is 212002200021201.
It is a junction number, because it is equal to n+sod(n) for n = 102120002200191 and 102120002200200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102120002200213) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 42831864 + ... + 45153167.
Almost surely, 2102120002200212 is an apocalyptic number.
102120002200212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102120002200212 is an abundant number, since it is smaller than the sum of its proper divisors (136928642881356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102120002200212 is an equidigital number, since it uses as much as digits as its factorization.
102120002200212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87985660 (or 87985347 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 102120002200212 its reverse (212002200021201), we get a palindrome (314122202221413).
The spelling of 102120002200212 in words is "one hundred two trillion, one hundred twenty billion, two million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •