Base | Representation |
---|---|
bin | 10010101000001111… |
… | …00101111011100111 |
3 | 221211000001011110100 |
4 | 21110013211323213 |
5 | 130440302223421 |
6 | 4332224355143 |
7 | 502560614613 |
oct | 112407457347 |
9 | 27730034410 |
10 | 10001211111 |
11 | 4272471a31 |
12 | 1b31475ab3 |
13 | c350227c8 |
14 | 6ac39a343 |
15 | 3d804bc26 |
hex | 2541e5ee7 |
10001211111 has 48 divisors (see below), whose sum is σ = 15174415360. Its totient is φ = 6341250240.
The previous prime is 10001211097. The next prime is 10001211131. The reversal of 10001211111 is 11111210001.
It is not a de Polignac number, because 10001211111 - 25 = 10001211079 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 = 10001211093 and 10001211102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001211131) 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 47 ways as a sum of consecutive naturals, for example, 2707776 + ... + 2711466.
Almost surely, 210001211111 is an apocalyptic number.
10001211111 is a deficient number, since it is larger than the sum of its proper divisors (5173204249).
10001211111 is a wasteful number, since it uses less digits than its factorization.
10001211111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3916 (or 3913 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10001211111 its reverse (11111210001), we get a palindrome (21112421112).
The spelling of 10001211111 in words is "ten billion, one million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •