Base | Representation |
---|---|
bin | 10111001100010011000000… |
… | …011001010010011111010100 |
3 | 111101011010010010101221021011 |
4 | 113030103000121102133110 |
5 | 101332132211431401322 |
6 | 1000534112035102004 |
7 | 30325156561631221 |
oct | 2714230031223724 |
9 | 441133103357234 |
10 | 102000111200212 |
11 | 2a5560056a9365 |
12 | b53437aa41904 |
13 | 44bb752742a54 |
14 | 1b28b9036a948 |
15 | bbd3cc415677 |
hex | 5cc4c06527d4 |
102000111200212 has 48 divisors (see below), whose sum is σ = 182195539384320. Its totient is φ = 49947726852608.
The previous prime is 102000111200203. The next prime is 102000111200297. The reversal of 102000111200212 is 212002111000201.
It is a super-2 number, since 2×1020001112002122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102000111200192 and 102000111200201.
It is a congruent number.
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, 1236878493 + ... + 1236960955.
It is an arithmetic number, because the mean of its divisors is an integer number (3795740403840).
Almost surely, 2102000111200212 is an apocalyptic number.
It is an amenable number.
102000111200212 is a deficient number, since it is larger than the sum of its proper divisors (80195428184108).
102000111200212 is a wasteful number, since it uses less digits than its factorization.
102000111200212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92952 (or 92950 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102000111200212 its reverse (212002111000201), we get a palindrome (314002222200413).
The spelling of 102000111200212 in words is "one hundred two trillion, one hundred eleven million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •