Base | Representation |
---|---|
bin | 10111001100011101010000… |
… | …100100111100101010001110 |
3 | 111101012011112100121111201221 |
4 | 113030131100210330222032 |
5 | 101332322233222011342 |
6 | 1000543132302153554 |
7 | 30326026440053611 |
oct | 2714352044745216 |
9 | 441164470544657 |
10 | 102011120110222 |
11 | 2a55a7449723a4 |
12 | b5365318828ba |
13 | 44bc7b8469a9b |
14 | 1b295164ba178 |
15 | bbd823b64a67 |
hex | 5cc75093ca8e |
102011120110222 has 4 divisors (see below), whose sum is σ = 153016680165336. Its totient is φ = 51005560055110.
The previous prime is 102011120110217. The next prime is 102011120110331. The reversal of 102011120110222 is 222011021110201.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1020111201102222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102011120110196 and 102011120110205.
It is a congruent number.
It is an unprimeable number.
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, 25502780027554 + ... + 25502780027557.
It is an arithmetic number, because the mean of its divisors is an integer number (38254170041334).
Almost surely, 2102011120110222 is an apocalyptic number.
102011120110222 is a deficient number, since it is larger than the sum of its proper divisors (51005560055114).
102011120110222 is an equidigital number, since it uses as much as digits as its factorization.
102011120110222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51005560055113.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102011120110222 its reverse (222011021110201), we get a palindrome (324022141220423).
The spelling of 102011120110222 in words is "one hundred two trillion, eleven billion, one hundred twenty million, one hundred ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •