Base | Representation |
---|---|
bin | 11110110110110011101… |
… | …110001101111010011011 |
3 | 21111201012200212202012100 |
4 | 132312303232031322123 |
5 | 234220122113123303 |
6 | 4302040342014443 |
7 | 306124222404366 |
oct | 36666356157233 |
9 | 7451180782170 |
10 | 2120434114203 |
11 | 7482a8861379 |
12 | 2a2b55117423 |
13 | 124c57675842 |
14 | 748b571b0dd |
15 | 3a2561348a3 |
hex | 1edb3b8de9b |
2120434114203 has 12 divisors (see below), whose sum is σ = 3062884492720. Its totient is φ = 1413606488976.
The previous prime is 2120434114193. The next prime is 2120434114213. The reversal of 2120434114203 is 3024114340212.
2120434114203 is a `hidden beast` number, since 2 + 1 + 2 + 0 + 43 + 411 + 4 + 203 = 666.
It is an interprime number because it is at equal distance from previous prime (2120434114193) and next prime (2120434114213).
It is not a de Polignac number, because 2120434114203 - 212 = 2120434110107 is a prime.
It is a super-2 number, since 2×21204341142032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2120434114213) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 499876 + ... + 2119137.
Almost surely, 22120434114203 is an apocalyptic number.
2120434114203 is a deficient number, since it is larger than the sum of its proper divisors (942450378517).
2120434114203 is a wasteful number, since it uses less digits than its factorization.
2120434114203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2708978 (or 2708975 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 2120434114203 its reverse (3024114340212), we get a palindrome (5144548454415).
The spelling of 2120434114203 in words is "two trillion, one hundred twenty billion, four hundred thirty-four million, one hundred fourteen thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •