Base | Representation |
---|---|
bin | 10110110000110011101111… |
… | …110111101111011100000110 |
3 | 111010110112022020011012020221 |
4 | 112300303233313233130012 |
5 | 101110210034224231042 |
6 | 552530225315014554 |
7 | 30041534634341203 |
oct | 2660635767573406 |
9 | 433415266135227 |
10 | 100111122102022 |
11 | 29997985598129 |
12 | b28a25829a45a |
13 | 43b2590c61935 |
14 | 1aa1593048caa |
15 | b891c0166d67 |
hex | 5b0cefdef706 |
100111122102022 has 4 divisors (see below), whose sum is σ = 150166683153036. Its totient is φ = 50055561051010.
The previous prime is 100111122102007. The next prime is 100111122102127. The reversal of 100111122102022 is 220201221111001.
It is a semiprime because it is the product of two primes.
It is a super-3 number, since 3×1001111221020223 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100111122101987 and 100111122102005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25027780525504 + ... + 25027780525507.
It is an arithmetic number, because the mean of its divisors is an integer number (37541670788259).
Almost surely, 2100111122102022 is an apocalyptic number.
100111122102022 is a deficient number, since it is larger than the sum of its proper divisors (50055561051014).
100111122102022 is an equidigital number, since it uses as much as digits as its factorization.
100111122102022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50055561051013.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 100111122102022 its reverse (220201221111001), we get a palindrome (320312343213023).
The spelling of 100111122102022 in words is "one hundred trillion, one hundred eleven billion, one hundred twenty-two million, one hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •