Base | Representation |
---|---|
bin | 10111001111011000100010… |
… | …101001110111010101010101 |
3 | 111101220101120212120100012100 |
4 | 113033120202221313111111 |
5 | 101344121103024010401 |
6 | 1001215350435112313 |
7 | 30346405632260313 |
oct | 2717304251672525 |
9 | 441811525510170 |
10 | 102212213110101 |
11 | 2a627a576a7586 |
12 | b5694b3442699 |
13 | 4505755058643 |
14 | 1b351517d70b3 |
15 | bc3b9303ab86 |
hex | 5cf622a77555 |
102212213110101 has 24 divisors (see below), whose sum is σ = 149173227212256. Its totient is φ = 67434416834400.
The previous prime is 102212213110097. The next prime is 102212213110219. The reversal of 102212213110101 is 101011312212201.
It is a happy number.
102212213110101 is a `hidden beast` number, since 10 + 2 + 21 + 221 + 311 + 0 + 101 = 666.
It is not a de Polignac number, because 102212213110101 - 22 = 102212213110097 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102212213117101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 25097595 + ... + 28884488.
It is an arithmetic number, because the mean of its divisors is an integer number (6215551133844).
Almost surely, 2102212213110101 is an apocalyptic number.
It is an amenable number.
102212213110101 is a deficient number, since it is larger than the sum of its proper divisors (46961014102155).
102212213110101 is a wasteful number, since it uses less digits than its factorization.
102212213110101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53984273 (or 53984270 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 102212213110101 its reverse (101011312212201), we get a palindrome (203223525322302).
The spelling of 102212213110101 in words is "one hundred two trillion, two hundred twelve billion, two hundred thirteen million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •