Base | Representation |
---|---|
bin | 10111001101111010011110… |
… | …011101011001010110000111 |
3 | 111101112201212212021121000000 |
4 | 113031322132131121112013 |
5 | 101340442230004014343 |
6 | 1001101124233252343 |
7 | 30336201666435504 |
oct | 2715723635312607 |
9 | 441481785247000 |
10 | 102111211001223 |
11 | 2a599137638226 |
12 | b551a05b640b3 |
13 | 44c9079a50b88 |
14 | 1b302cd63a4ab |
15 | bc1230d54ed3 |
hex | 5cde9e759587 |
102111211001223 has 28 divisors (see below), whose sum is σ = 154527592536648. Its totient is φ = 67437933693840.
The previous prime is 102111211001153. The next prime is 102111211001227. The reversal of 102111211001223 is 322100112111201.
It is a happy number.
102111211001223 is a `hidden beast` number, since 10 + 211 + 121 + 100 + 1 + 223 = 666.
It is not a de Polignac number, because 102111211001223 - 210 = 102111211000199 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102111211001196 and 102111211001205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102111211001227) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 654455868 + ... + 654611873.
Almost surely, 2102111211001223 is an apocalyptic number.
102111211001223 is a deficient number, since it is larger than the sum of its proper divisors (52416381535425).
102111211001223 is an equidigital number, since it uses as much as digits as its factorization.
102111211001223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1309067866 (or 1309067851 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 102111211001223 its reverse (322100112111201), we get a palindrome (424211323112424).
The spelling of 102111211001223 in words is "one hundred two trillion, one hundred eleven billion, two hundred eleven million, one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •