Base | Representation |
---|---|
bin | 111111001101101… |
… | …0110111011100111 |
3 | 12110211020002121110 |
4 | 1332123112323213 |
5 | 13321000213111 |
6 | 550250320103 |
7 | 103364030010 |
oct | 17633267347 |
9 | 5424202543 |
10 | 2121101031 |
11 | 999340665 |
12 | 4b2429033 |
13 | 27a59848a |
14 | 1619c0007 |
15 | c63345a6 |
hex | 7e6d6ee7 |
2121101031 has 16 divisors (see below), whose sum is σ = 3249082368. Its totient is φ = 1205709600.
The previous prime is 2121101029. The next prime is 2121101053. The reversal of 2121101031 is 1301011212.
It is not a de Polignac number, because 2121101031 - 21 = 2121101029 is a prime.
It is a super-2 number, since 2×21211010312 = 8998139167418525922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2121100998 and 2121101016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2121101071) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 260400 + ... + 268421.
It is an arithmetic number, because the mean of its divisors is an integer number (203067648).
Almost surely, 22121101031 is an apocalyptic number.
2121101031 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2121101031 is a deficient number, since it is larger than the sum of its proper divisors (1127981337).
2121101031 is a wasteful number, since it uses less digits than its factorization.
2121101031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 529022.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 2121101031 is about 46055.4126135029. The cubic root of 2121101031 is about 1284.8540121917.
Adding to 2121101031 its reverse (1301011212), we get a palindrome (3422112243).
The spelling of 2121101031 in words is "two billion, one hundred twenty-one million, one hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •