Base | Representation |
---|---|
bin | 10010110001010101… |
… | …101010011010000001 |
3 | 1221000122101221012211 |
4 | 102301111222122001 |
5 | 312234202141022 |
6 | 13131550022121 |
7 | 1312314436423 |
oct | 226125523201 |
9 | 57018357184 |
10 | 20155115137 |
11 | 8603045353 |
12 | 3aa5aa7941 |
13 | 1b92877b41 |
14 | d92b42813 |
15 | 7ce6aae77 |
hex | 4b156a681 |
20155115137 has 2 divisors, whose sum is σ = 20155115138. Its totient is φ = 20155115136.
The previous prime is 20155115083. The next prime is 20155115143. The reversal of 20155115137 is 73151155102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16869074161 + 3286040976 = 129881^2 + 57324^2 .
It is a cyclic number.
It is not a de Polignac number, because 20155115137 - 27 = 20155115009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20155115099 and 20155115108.
It is not a weakly prime, because it can be changed into another prime (20155115147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10077557568 + 10077557569.
It is an arithmetic number, because the mean of its divisors is an integer number (10077557569).
Almost surely, 220155115137 is an apocalyptic number.
It is an amenable number.
20155115137 is a deficient number, since it is larger than the sum of its proper divisors (1).
20155115137 is an equidigital number, since it uses as much as digits as its factorization.
20155115137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5250, while the sum is 31.
The spelling of 20155115137 in words is "twenty billion, one hundred fifty-five million, one hundred fifteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •