Base | Representation |
---|---|
bin | 11110111111100001010… |
… | …110001101111000100101 |
3 | 21112121100200201001102202 |
4 | 132333201112031320211 |
5 | 234343302103243112 |
6 | 4310224540344245 |
7 | 306605112062342 |
oct | 36774126157045 |
9 | 7477320631382 |
10 | 2129789509157 |
11 | 751269722042 |
12 | 2a4926245085 |
13 | 125ab894a7bb |
14 | 751220057c9 |
15 | 3a6026136c2 |
hex | 1efe158de25 |
2129789509157 has 2 divisors, whose sum is σ = 2129789509158. Its totient is φ = 2129789509156.
The previous prime is 2129789509151. The next prime is 2129789509163. The reversal of 2129789509157 is 7519059879212.
It is a balanced prime because it is at equal distance from previous prime (2129789509151) and next prime (2129789509163).
It can be written as a sum of positive squares in only one way, i.e., 1832880037921 + 296909471236 = 1353839^2 + 544894^2 .
It is a cyclic number.
It is not a de Polignac number, because 2129789509157 - 220 = 2129788460581 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2129789509093 and 2129789509102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2129789509151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1064894754578 + 1064894754579.
It is an arithmetic number, because the mean of its divisors is an integer number (1064894754579).
Almost surely, 22129789509157 is an apocalyptic number.
It is an amenable number.
2129789509157 is a deficient number, since it is larger than the sum of its proper divisors (1).
2129789509157 is an equidigital number, since it uses as much as digits as its factorization.
2129789509157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28576800, while the sum is 65.
The spelling of 2129789509157 in words is "two trillion, one hundred twenty-nine billion, seven hundred eighty-nine million, five hundred nine thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •