Base | Representation |
---|---|
bin | 10111001101110000001000… |
… | …001101000011101011111100 |
3 | 111101111200012112100110201111 |
4 | 113031300020031003223330 |
5 | 101340302001122414322 |
6 | 1001052045530251404 |
7 | 30335326443256531 |
oct | 2715601015035374 |
9 | 441450175313644 |
10 | 102100100201212 |
11 | 2a594455901783 |
12 | b54b824b86b64 |
13 | 44c7cc8ba0cb9 |
14 | 1b2d957b66d88 |
15 | bc0cd06cb177 |
hex | 5cdc08343afc |
102100100201212 has 6 divisors (see below), whose sum is σ = 178675175352128. Its totient is φ = 51050050100604.
The previous prime is 102100100201207. The next prime is 102100100201213. The reversal of 102100100201212 is 212102001001201.
It is a super-2 number, since 2×1021001002012122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102100100201192 and 102100100201201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102100100201213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12762512525148 + ... + 12762512525155.
Almost surely, 2102100100201212 is an apocalyptic number.
It is an amenable number.
102100100201212 is a deficient number, since it is larger than the sum of its proper divisors (76575075150916).
102100100201212 is a wasteful number, since it uses less digits than its factorization.
102100100201212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25525025050307 (or 25525025050305 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102100100201212 its reverse (212102001001201), we get a palindrome (314202101202413).
The spelling of 102100100201212 in words is "one hundred two trillion, one hundred billion, one hundred million, two hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •