Base | Representation |
---|---|
bin | 1001111001010001… |
… | …1010001010001101 |
3 | 20212010000102000202 |
4 | 2132110122022031 |
5 | 20414433301112 |
6 | 1115322303245 |
7 | 122551622003 |
oct | 23624321215 |
9 | 6763012022 |
10 | 2656150157 |
11 | 1143366a21 |
12 | 621657b25 |
13 | 3343a27ab |
14 | 1b2a9aa73 |
15 | 1082c26c2 |
hex | 9e51a28d |
2656150157 has 2 divisors, whose sum is σ = 2656150158. Its totient is φ = 2656150156.
The previous prime is 2656150141. The next prime is 2656150169. The reversal of 2656150157 is 7510516562.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1479248521 + 1176901636 = 38461^2 + 34306^2 .
It is a cyclic number.
It is not a de Polignac number, because 2656150157 - 24 = 2656150141 is a prime.
It is a super-2 number, since 2×26561501572 = 14110267313062249298, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2656150157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2656150457) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1328075078 + 1328075079.
It is an arithmetic number, because the mean of its divisors is an integer number (1328075079).
Almost surely, 22656150157 is an apocalyptic number.
It is an amenable number.
2656150157 is a deficient number, since it is larger than the sum of its proper divisors (1).
2656150157 is an equidigital number, since it uses as much as digits as its factorization.
2656150157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63000, while the sum is 38.
The square root of 2656150157 is about 51537.8516917421. The cubic root of 2656150157 is about 1384.8972119367.
The spelling of 2656150157 in words is "two billion, six hundred fifty-six million, one hundred fifty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •