Base | Representation |
---|---|
bin | 101111000101000100… |
… | …1111100100100101110 |
3 | 100122221222110101100110 |
4 | 1132022021330210232 |
5 | 3124024120023042 |
6 | 114240133040450 |
7 | 10206255523113 |
oct | 1361211744456 |
9 | 318858411313 |
10 | 101102111022 |
11 | 39971562460 |
12 | 17716a86126 |
13 | 96c2c4c243 |
14 | 4c7158c90a |
15 | 296ad8b09c |
hex | 178a27c92e |
101102111022 has 64 divisors (see below), whose sum is σ = 232272230400. Its totient is φ = 29015030880.
The previous prime is 101102110997. The next prime is 101102111029. The reversal of 101102111022 is 220111201101.
It is a junction number, because it is equal to n+sod(n) for n = 101102110989 and 101102111007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101102111029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4411429 + ... + 4434287.
It is an arithmetic number, because the mean of its divisors is an integer number (3629253600).
Almost surely, 2101102111022 is an apocalyptic number.
101102111022 is an abundant number, since it is smaller than the sum of its proper divisors (131170119378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101102111022 is a wasteful number, since it uses less digits than its factorization.
101102111022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26421.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101102111022 its reverse (220111201101), we get a palindrome (321213312123).
The spelling of 101102111022 in words is "one hundred one billion, one hundred two million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •