Base | Representation |
---|---|
bin | 10110110000110011101001… |
… | …110110100010000111100101 |
3 | 111010110112001012010212201220 |
4 | 112300303221312202013211 |
5 | 101110204332401401041 |
6 | 552530211310410553 |
7 | 30041532300124650 |
oct | 2660635166420745 |
9 | 433415035125656 |
10 | 100111021122021 |
11 | 29997933597388 |
12 | b28a22a500a59 |
13 | 43b2576067060 |
14 | 1aa1583880897 |
15 | b891b636bd66 |
hex | 5b0ce9da21e5 |
100111021122021 has 128 divisors (see below), whose sum is σ = 175236010177536. Its totient is φ = 49332914749440.
The previous prime is 100111021121981. The next prime is 100111021122043. The reversal of 100111021122021 is 120221120111001.
It is a happy number.
It is not a de Polignac number, because 100111021122021 - 218 = 100111020859877 is a prime.
It is a super-2 number, since 2×1001110211220212 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100111021122121) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 395755501 + ... + 396008381.
It is an arithmetic number, because the mean of its divisors is an integer number (1369031329512).
Almost surely, 2100111021122021 is an apocalyptic number.
It is an amenable number.
100111021122021 is a deficient number, since it is larger than the sum of its proper divisors (75124989055515).
100111021122021 is a wasteful number, since it uses less digits than its factorization.
100111021122021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 253551.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 100111021122021 its reverse (120221120111001), we get a palindrome (220332141233022).
The spelling of 100111021122021 in words is "one hundred trillion, one hundred eleven billion, twenty-one million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •