Base | Representation |
---|---|
bin | 10010101000001111… |
… | …00101111011110001 |
3 | 221211000001011110201 |
4 | 21110013211323301 |
5 | 130440302223441 |
6 | 4332224355201 |
7 | 502560614626 |
oct | 112407457361 |
9 | 27730034421 |
10 | 10001211121 |
11 | 4272471a40 |
12 | 1b31475b01 |
13 | c35022805 |
14 | 6ac39a34d |
15 | 3d804bc31 |
hex | 2541e5ef1 |
10001211121 has 8 divisors (see below), whose sum is σ = 11286633600. Its totient is φ = 8778492240.
The previous prime is 10001211097. The next prime is 10001211131. The reversal of 10001211121 is 12111210001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10001211121 - 211 = 10001209073 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10001211098 and 10001211107.
It is not an unprimeable number, because it can be changed into a prime (10001211131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15675561 + ... + 15676198.
It is an arithmetic number, because the mean of its divisors is an integer number (1410829200).
Almost surely, 210001211121 is an apocalyptic number.
10001211121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10001211121 is a deficient number, since it is larger than the sum of its proper divisors (1285422479).
10001211121 is a wasteful number, since it uses less digits than its factorization.
10001211121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31351799.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10001211121 its reverse (12111210001), we get a palindrome (22112421122).
It can be divided in two parts, 10001 and 211121, that added together give a palindrome (221122).
The spelling of 10001211121 in words is "ten billion, one million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •