Base | Representation |
---|---|
bin | 10111000000111101011111… |
… | …110001101000011101010010 |
3 | 111021101122100120111011000022 |
4 | 113000331133301220131102 |
5 | 101231401303341023442 |
6 | 555140155405223442 |
7 | 30214661150263556 |
oct | 2700753761503522 |
9 | 437348316434008 |
10 | 101221101111122 |
11 | 2a28569a826383 |
12 | b4293b1b61b82 |
13 | 4463155287c05 |
14 | 1add1ad96d866 |
15 | ba7ed6c2b3d2 |
hex | 5c0f5fc68752 |
101221101111122 has 8 divisors (see below), whose sum is σ = 158433027826176. Its totient is φ = 48410091835732.
The previous prime is 101221101111121. The next prime is 101221101111223. The reversal of 101221101111122 is 221111101122101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1012211011111222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101221101111122.
It is not an unprimeable number, because it can be changed into a prime (101221101111121) 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, 1100229359858 + ... + 1100229359949.
It is an arithmetic number, because the mean of its divisors is an integer number (19804128478272).
Almost surely, 2101221101111122 is an apocalyptic number.
101221101111122 is a deficient number, since it is larger than the sum of its proper divisors (57211926715054).
101221101111122 is a wasteful number, since it uses less digits than its factorization.
101221101111122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2200458719832.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 101221101111122 its reverse (221111101122101), we get a palindrome (322332202233223).
The spelling of 101221101111122 in words is "one hundred one trillion, two hundred twenty-one billion, one hundred one million, one hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •