Base | Representation |
---|---|
bin | 10010101010100110… |
… | …01100110011000111 |
3 | 221212101100010101102 |
4 | 21111103030303013 |
5 | 131010340443421 |
6 | 4334213250315 |
7 | 503221234100 |
oct | 112523146307 |
9 | 27771303342 |
10 | 10021031111 |
11 | 4282679aa3 |
12 | 1b3803399b |
13 | c39172010 |
14 | 6b0c793a7 |
15 | 3d9b6460b |
hex | 2554cccc7 |
10021031111 has 24 divisors (see below), whose sum is σ = 12644246160. Its totient is φ = 7871617152.
The previous prime is 10021031101. The next prime is 10021031131. The reversal of 10021031111 is 11113012001.
It is a happy number.
10021031111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10021031111 - 214 = 10021014727 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10021031092 and 10021031101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10021031101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 31955 + ... + 145131.
It is an arithmetic number, because the mean of its divisors is an integer number (526843590).
Almost surely, 210021031111 is an apocalyptic number.
10021031111 is a deficient number, since it is larger than the sum of its proper divisors (2623215049).
10021031111 is a wasteful number, since it uses less digits than its factorization.
10021031111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113343 (or 113336 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 10021031111 its reverse (11113012001), we get a palindrome (21134043112).
The spelling of 10021031111 in words is "ten billion, twenty-one million, thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •