Base | Representation |
---|---|
bin | 11111001001001001100… |
… | …101010100111011110101 |
3 | 21120121001012211202102002 |
4 | 133021021211110323311 |
5 | 240030440312012003 |
6 | 4315054503225045 |
7 | 310422241565051 |
oct | 37111145247365 |
9 | 7517035752362 |
10 | 2140128235253 |
11 | 755694660a78 |
12 | 2a6930748185 |
13 | 126a758747c8 |
14 | 7582313cc61 |
15 | 3aa0a0cea88 |
hex | 1f249954ef5 |
2140128235253 has 2 divisors, whose sum is σ = 2140128235254. Its totient is φ = 2140128235252.
The previous prime is 2140128235171. The next prime is 2140128235313. The reversal of 2140128235253 is 3525328210412.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1630849040209 + 509279195044 = 1277047^2 + 713638^2 .
It is a cyclic number.
It is not a de Polignac number, because 2140128235253 - 28 = 2140128234997 is a prime.
It is a super-2 number, since 2×21401282352532 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2140128235153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1070064117626 + 1070064117627.
It is an arithmetic number, because the mean of its divisors is an integer number (1070064117627).
Almost surely, 22140128235253 is an apocalyptic number.
It is an amenable number.
2140128235253 is a deficient number, since it is larger than the sum of its proper divisors (1).
2140128235253 is an equidigital number, since it uses as much as digits as its factorization.
2140128235253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 115200, while the sum is 38.
The spelling of 2140128235253 in words is "two trillion, one hundred forty billion, one hundred twenty-eight million, two hundred thirty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •