Base | Representation |
---|---|
bin | 100010011000010110000001… |
… | …101110101100011010101101 |
3 | 201211101012101222101002122022 |
4 | 202120112001232230122231 |
5 | 124304331403020011401 |
6 | 1253331150205355525 |
7 | 43564211013654644 |
oct | 4230260156543255 |
9 | 654335358332568 |
10 | 151206500157101 |
11 | 441a7353436614 |
12 | 14b609bab68ba5 |
13 | 664a933a2b10c |
14 | 294a60dd4a35b |
15 | 1273364aec71b |
hex | 898581bac6ad |
151206500157101 has 2 divisors, whose sum is σ = 151206500157102. Its totient is φ = 151206500157100.
The previous prime is 151206500157079. The next prime is 151206500157107. The reversal of 151206500157101 is 101751005602151.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 149675771982025 + 1530728175076 = 12234205^2 + 1237226^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-151206500157101 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (151206500157107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75603250078550 + 75603250078551.
It is an arithmetic number, because the mean of its divisors is an integer number (75603250078551).
Almost surely, 2151206500157101 is an apocalyptic number.
It is an amenable number.
151206500157101 is a deficient number, since it is larger than the sum of its proper divisors (1).
151206500157101 is an equidigital number, since it uses as much as digits as its factorization.
151206500157101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10500, while the sum is 35.
Adding to 151206500157101 its reverse (101751005602151), we get a palindrome (252957505759252).
The spelling of 151206500157101 in words is "one hundred fifty-one trillion, two hundred six billion, five hundred million, one hundred fifty-seven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •