Base | Representation |
---|---|
bin | 10011000010010100… |
… | …01111101001111111 |
3 | 222101020202022021000 |
4 | 21201022033221333 |
5 | 131412310310421 |
6 | 4410042141343 |
7 | 511155436563 |
oct | 114112175177 |
9 | 28336668230 |
10 | 10220010111 |
11 | 4374a24953 |
12 | 1b927b1853 |
13 | c6b45c67c |
14 | 6cd4736a3 |
15 | 3ec36b226 |
hex | 26128fa7f |
10220010111 has 16 divisors (see below), whose sum is σ = 15937638400. Its totient is φ = 6454742904.
The previous prime is 10220010109. The next prime is 10220010127. The reversal of 10220010111 is 11101002201.
It is a happy number.
It is not a de Polignac number, because 10220010111 - 21 = 10220010109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10220010093 and 10220010102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220010131) 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 15 ways as a sum of consecutive naturals, for example, 9960511 + ... + 9961536.
It is an arithmetic number, because the mean of its divisors is an integer number (996102400).
Almost surely, 210220010111 is an apocalyptic number.
10220010111 is a deficient number, since it is larger than the sum of its proper divisors (5717628289).
10220010111 is a wasteful number, since it uses less digits than its factorization.
10220010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19922075 (or 19922069 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10220010111 its reverse (11101002201), we get a palindrome (21321012312).
The spelling of 10220010111 in words is "ten billion, two hundred twenty million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •