Base | Representation |
---|---|
bin | 10111001101110001000100… |
… | …100000110110010001100000 |
3 | 111101111202211001021022001122 |
4 | 113031301010200312101200 |
5 | 101340311034134201422 |
6 | 1001052334153151412 |
7 | 30335363510512640 |
oct | 2715610440662140 |
9 | 441452731238048 |
10 | 102101112022112 |
11 | 2a594924a697a5 |
12 | b54ba679bb568 |
13 | 44c812a6b97a8 |
14 | 1b2da122b0520 |
15 | bc0d3e444d42 |
hex | 5cdc44836460 |
102101112022112 has 24 divisors (see below), whose sum is σ = 229727502050256. Its totient is φ = 43757619437952.
The previous prime is 102101112022111. The next prime is 102101112022157. The reversal of 102101112022112 is 211220211101201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102101112022111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 227904267683 + ... + 227904268130.
It is an arithmetic number, because the mean of its divisors is an integer number (9571979252094).
Almost surely, 2102101112022112 is an apocalyptic number.
It is an amenable number.
102101112022112 is an abundant number, since it is smaller than the sum of its proper divisors (127626390028144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102101112022112 is an equidigital number, since it uses as much as digits as its factorization.
102101112022112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 455808535830 (or 455808535822 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 102101112022112 its reverse (211220211101201), we get a palindrome (313321323123313).
The spelling of 102101112022112 in words is "one hundred two trillion, one hundred one billion, one hundred twelve million, twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •