Base | Representation |
---|---|
bin | 10010111011110001… |
… | …00111001010011101 |
3 | 222020102100100121101 |
4 | 21131320213022131 |
5 | 131304223244112 |
6 | 4400400233101 |
7 | 506620360144 |
oct | 113570471235 |
9 | 28212310541 |
10 | 10165056157 |
11 | 4346a00163 |
12 | 1b7830b791 |
13 | c5cc5b439 |
14 | 6c604a75b |
15 | 3e7613757 |
hex | 25de2729d |
10165056157 has 2 divisors, whose sum is σ = 10165056158. Its totient is φ = 10165056156.
The previous prime is 10165056119. The next prime is 10165056179. The reversal of 10165056157 is 75165056101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9348182596 + 816873561 = 96686^2 + 28581^2 .
It is a cyclic number.
It is not a de Polignac number, because 10165056157 - 27 = 10165056029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10165050157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5082528078 + 5082528079.
It is an arithmetic number, because the mean of its divisors is an integer number (5082528079).
Almost surely, 210165056157 is an apocalyptic number.
It is an amenable number.
10165056157 is a deficient number, since it is larger than the sum of its proper divisors (1).
10165056157 is an equidigital number, since it uses as much as digits as its factorization.
10165056157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31500, while the sum is 37.
The spelling of 10165056157 in words is "ten billion, one hundred sixty-five million, fifty-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •