Base | Representation |
---|---|
bin | 111111001101100… |
… | …0101110111001001 |
3 | 12110211002112200220 |
4 | 1332123011313021 |
5 | 13320440443423 |
6 | 550245020253 |
7 | 103363316115 |
oct | 17633056711 |
9 | 5424075626 |
10 | 2121031113 |
11 | 9992a3083 |
12 | 4b23b4689 |
13 | 27a5726c6 |
14 | 1619a2745 |
15 | c631d9e3 |
hex | 7e6c5dc9 |
2121031113 has 8 divisors (see below), whose sum is σ = 2828259168. Its totient is φ = 1413911904.
The previous prime is 2121031111. The next prime is 2121031141. The reversal of 2121031113 is 3111301212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2121031113 - 21 = 2121031111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2121031092 and 2121031101.
It is not an unprimeable number, because it can be changed into a prime (2121031111) 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 7 ways as a sum of consecutive naturals, for example, 47806 + ... + 80792.
It is an arithmetic number, because the mean of its divisors is an integer number (353532396).
Almost surely, 22121031113 is an apocalyptic number.
It is an amenable number.
2121031113 is a deficient number, since it is larger than the sum of its proper divisors (707228055).
2121031113 is a wasteful number, since it uses less digits than its factorization.
2121031113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54423.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 2121031113 is about 46054.6535433717. The cubic root of 2121031113 is about 1284.8398944593.
Adding to 2121031113 its reverse (3111301212), we get a palindrome (5232332325).
The spelling of 2121031113 in words is "two billion, one hundred twenty-one million, thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •