Base | Representation |
---|---|
bin | 10111001101110000001000… |
… | …110110101011001101101110 |
3 | 111101111200020021212202011112 |
4 | 113031300020312223031232 |
5 | 101340302011421023042 |
6 | 1001052051000152022 |
7 | 30335326635065543 |
oct | 2715601066531556 |
9 | 441450207782145 |
10 | 102100111111022 |
11 | 2a594460a83452 |
12 | b54b828768612 |
13 | 44c7ccb2209cb |
14 | 1b2d9593a6bca |
15 | bc0cd1633982 |
hex | 5cdc08dab36e |
102100111111022 has 8 divisors (see below), whose sum is σ = 156039792452856. Its totient is φ = 50086846960072.
The previous prime is 102100111111001. The next prime is 102100111111027. The reversal of 102100111111022 is 220111111001201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 102100111110988 and 102100111111006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102100111111027) 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, 481604297588 + ... + 481604297799.
It is an arithmetic number, because the mean of its divisors is an integer number (19504974056607).
Almost surely, 2102100111111022 is an apocalyptic number.
102100111111022 is a deficient number, since it is larger than the sum of its proper divisors (53939681341834).
102100111111022 is an equidigital number, since it uses as much as digits as its factorization.
102100111111022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 963208595442.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 102100111111022 its reverse (220111111001201), we get a palindrome (322211222112223).
The spelling of 102100111111022 in words is "one hundred two trillion, one hundred billion, one hundred eleven million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •