Base | Representation |
---|---|
bin | 10110110000110011101001… |
… | …010000010011100101011110 |
3 | 111010110112000111021202111210 |
4 | 112300303221100103211132 |
5 | 101110204322320213042 |
6 | 552530210311525250 |
7 | 30041532116010135 |
oct | 2660635120234536 |
9 | 433415014252453 |
10 | 100111011101022 |
11 | 29997928972469 |
12 | b28a227089826 |
13 | 43b2573c68a7c |
14 | 1aa15823d291c |
15 | b891b553ca9c |
hex | 5b0ce941395e |
100111011101022 has 32 divisors (see below), whose sum is σ = 200992976059392. Its totient is φ = 33241919203584.
The previous prime is 100111011101011. The next prime is 100111011101027. The reversal of 100111011101022 is 220101110111001.
It is a junction number, because it is equal to n+sod(n) for n = 100111011100989 and 100111011101007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100111011101027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3930643 + ... + 14685774.
It is an arithmetic number, because the mean of its divisors is an integer number (6281030501856).
Almost surely, 2100111011101022 is an apocalyptic number.
100111011101022 is an abundant number, since it is smaller than the sum of its proper divisors (100881964958370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100111011101022 is a wasteful number, since it uses less digits than its factorization.
100111011101022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18619872.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 100111011101022 its reverse (220101110111001), we get a palindrome (320212121212023).
The spelling of 100111011101022 in words is "one hundred trillion, one hundred eleven billion, eleven million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •