Base | Representation |
---|---|
bin | 10111001101110000001110… |
… | …001110010110000111000000 |
3 | 111101111200110120101211220120 |
4 | 113031300032032112013000 |
5 | 101340302203001431422 |
6 | 1001052103535140240 |
7 | 30335332110621021 |
oct | 2715601616260700 |
9 | 441450416354816 |
10 | 102100201202112 |
11 | 2a5944a79171a3 |
12 | b54b852974680 |
13 | 44c8013aa5249 |
14 | 1b2d967338c48 |
15 | bc0cd94cc45c |
hex | 5cdc0e3961c0 |
102100201202112 has 56 divisors (see below), whose sum is σ = 270211829863296. Its totient is φ = 34024365543168.
The previous prime is 102100201202099. The next prime is 102100201202113. The reversal of 102100201202112 is 211202102001201.
It is a junction number, because it is equal to n+sod(n) for n = 102100201202091 and 102100201202100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102100201202113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69859678 + ... + 71306205.
Almost surely, 2102100201202112 is an apocalyptic number.
102100201202112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102100201202112 is an abundant number, since it is smaller than the sum of its proper divisors (168111628661184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102100201202112 is a wasteful number, since it uses less digits than its factorization.
102100201202112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141169665 (or 141169655 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102100201202112 its reverse (211202102001201), we get a palindrome (313302303203313).
The spelling of 102100201202112 in words is "one hundred two trillion, one hundred billion, two hundred one million, two hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •