Base | Representation |
---|---|
bin | 11101000110110010011… |
… | …110010101111010010101 |
3 | 21002012202011210111021222 |
4 | 131012302132111322111 |
5 | 230232303421404112 |
6 | 4130505203420125 |
7 | 264335453154305 |
oct | 35066236257225 |
9 | 7065664714258 |
10 | 2000154091157 |
11 | 701295927852 |
12 | 283787684645 |
13 | 1167c9466481 |
14 | 6cb45121605 |
15 | 370667b9372 |
hex | 1d1b2795e95 |
2000154091157 has 2 divisors, whose sum is σ = 2000154091158. Its totient is φ = 2000154091156.
The previous prime is 2000154091151. The next prime is 2000154091231. The reversal of 2000154091157 is 7511904510002.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1147660121521 + 852493969636 = 1071289^2 + 923306^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000154091157 - 216 = 2000154025621 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2000154091151) 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, 1000077045578 + 1000077045579.
It is an arithmetic number, because the mean of its divisors is an integer number (1000077045579).
Almost surely, 22000154091157 is an apocalyptic number.
It is an amenable number.
2000154091157 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000154091157 is an equidigital number, since it uses as much as digits as its factorization.
2000154091157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 35.
The spelling of 2000154091157 in words is "two trillion, one hundred fifty-four million, ninety-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •