Base | Representation |
---|---|
bin | 100010101101000111000010… |
… | …010101111000011101101101 |
3 | 202000102121202222101110020112 |
4 | 202231013002111320131231 |
5 | 130001221413402023112 |
6 | 1300342511254025405 |
7 | 44102256514446641 |
oct | 4255070225703555 |
9 | 660377688343215 |
10 | 152633513314157 |
11 | 446a7567133597 |
12 | 15151492948265 |
13 | 6722380c71395 |
14 | 2999704020c21 |
15 | 129a534540a22 |
hex | 8ad1c257876d |
152633513314157 has 2 divisors, whose sum is σ = 152633513314158. Its totient is φ = 152633513314156.
The previous prime is 152633513314109. The next prime is 152633513314241. The reversal of 152633513314157 is 751413315336251.
152633513314157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 124748660780836 + 27884852533321 = 11169094^2 + 5280611^2 .
It is a cyclic number.
It is not a de Polignac number, because 152633513314157 - 28 = 152633513313901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (152633513214157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76316756657078 + 76316756657079.
It is an arithmetic number, because the mean of its divisors is an integer number (76316756657079).
Almost surely, 2152633513314157 is an apocalyptic number.
It is an amenable number.
152633513314157 is a deficient number, since it is larger than the sum of its proper divisors (1).
152633513314157 is an equidigital number, since it uses as much as digits as its factorization.
152633513314157 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3402000, while the sum is 50.
The spelling of 152633513314157 in words is "one hundred fifty-two trillion, six hundred thirty-three billion, five hundred thirteen million, three hundred fourteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •