Base | Representation |
---|---|
bin | 111111001101101… |
… | …1010001000010011 |
3 | 12110211020202120122 |
4 | 1332123122020103 |
5 | 13321001123011 |
6 | 550250500455 |
7 | 103364113133 |
oct | 17633321023 |
9 | 5424222518 |
10 | 2121114131 |
11 | 99934a494 |
12 | 4b243472b |
13 | 27a5a1426 |
14 | 1619c4ac3 |
15 | c63383db |
hex | 7e6da213 |
2121114131 has 8 divisors (see below), whose sum is σ = 2178537984. Its totient is φ = 2063961280.
The previous prime is 2121114091. The next prime is 2121114161. The reversal of 2121114131 is 1314111212.
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 2121114131 - 214 = 2121097747 is a prime.
It is a super-2 number, since 2×21211141312 = 8998250313455770322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2121114161) 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 7 ways as a sum of consecutive naturals, for example, 51836 + ... + 83241.
It is an arithmetic number, because the mean of its divisors is an integer number (272317248).
Almost surely, 22121114131 is an apocalyptic number.
2121114131 is a deficient number, since it is larger than the sum of its proper divisors (57423853).
2121114131 is a wasteful number, since it uses less digits than its factorization.
2121114131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135501.
The product of its digits is 48, while the sum is 17.
The square root of 2121114131 is about 46055.5548332663. The cubic root of 2121114131 is about 1284.8566572885.
Adding to 2121114131 its reverse (1314111212), we get a palindrome (3435225343).
The spelling of 2121114131 in words is "two billion, one hundred twenty-one million, one hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •