Base | Representation |
---|---|
bin | 10110110000110011101001… |
… | …010000110000101000110101 |
3 | 111010110112000111111210202011 |
4 | 112300303221100300220311 |
5 | 101110204322333020041 |
6 | 552530210314244221 |
7 | 30041532120014104 |
oct | 2660635120605065 |
9 | 433415014453664 |
10 | 100111011220021 |
11 | 29997928a4390a |
12 | b28a227126671 |
13 | 43b2573caac99 |
14 | 1aa158242403b |
15 | b891b5562e81 |
hex | 5b0ce9430a35 |
100111011220021 has 16 divisors (see below), whose sum is σ = 103269829682880. Its totient is φ = 97007871121920.
The previous prime is 100111011220009. The next prime is 100111011220061. The reversal of 100111011220021 is 120022110111001.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100111011220021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100111011219983 and 100111011220010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100111011220061) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26219931 + ... + 29794408.
It is an arithmetic number, because the mean of its divisors is an integer number (6454364355180).
Almost surely, 2100111011220021 is an apocalyptic number.
It is an amenable number.
100111011220021 is a deficient number, since it is larger than the sum of its proper divisors (3158818462859).
100111011220021 is an equidigital number, since it uses as much as digits as its factorization.
100111011220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56014836.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100111011220021 its reverse (120022110111001), we get a palindrome (220133121331022).
The spelling of 100111011220021 in words is "one hundred trillion, one hundred eleven billion, eleven million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •