Base | Representation |
---|---|
bin | 10111001101110000001000… |
… | …110111000001001111000110 |
3 | 111101111200020022001022220021 |
4 | 113031300020313001033012 |
5 | 101340302011431414342 |
6 | 1001052051002125354 |
7 | 30335326635622531 |
oct | 2715601067011706 |
9 | 441450208038807 |
10 | 102100111201222 |
11 | 2a5944610351a2 |
12 | b54b8287b085a |
13 | 44c7ccb252a94 |
14 | 1b2d9593cba18 |
15 | bc0cd1650567 |
hex | 5cdc08dc13c6 |
102100111201222 has 8 divisors (see below), whose sum is σ = 153179738195400. Its totient is φ = 51040198469424.
The previous prime is 102100111201201. The next prime is 102100111201229. The reversal of 102100111201222 is 222102111001201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1021001112012222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102100111201196 and 102100111201205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102100111201229) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4928552647 + ... + 4928573362.
It is an arithmetic number, because the mean of its divisors is an integer number (19147467274425).
Almost surely, 2102100111201222 is an apocalyptic number.
102100111201222 is a deficient number, since it is larger than the sum of its proper divisors (51079626994178).
102100111201222 is an equidigital number, since it uses as much as digits as its factorization.
102100111201222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9857131190.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102100111201222 its reverse (222102111001201), we get a palindrome (324202222202423).
The spelling of 102100111201222 in words is "one hundred two trillion, one hundred billion, one hundred eleven million, two hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •