Base | Representation |
---|---|
bin | 100010101001101010010010… |
… | …001110011110010111011001 |
3 | 201222120221221220210000122102 |
4 | 202221222102032132113121 |
5 | 124433330444103131401 |
6 | 1300041551104533145 |
7 | 44046165625044413 |
oct | 4251522216362731 |
9 | 658527856700572 |
10 | 152396482864601 |
11 | 44615a92677578 |
12 | 151135619211b5 |
13 | 6705c07b826c1 |
14 | 298c059ccd9b3 |
15 | 12942b016156b |
hex | 8a9a9239e5d9 |
152396482864601 has 2 divisors, whose sum is σ = 152396482864602. Its totient is φ = 152396482864600.
The previous prime is 152396482864597. The next prime is 152396482864651. The reversal of 152396482864601 is 106468284693251.
152396482864601 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., 148224513213001 + 4171969651600 = 12174749^2 + 2042540^2 .
It is a cyclic number.
It is not a de Polignac number, because 152396482864601 - 22 = 152396482864597 is a prime.
It is not a weakly prime, because it can be changed into another prime (152396482864651) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76198241432300 + 76198241432301.
It is an arithmetic number, because the mean of its divisors is an integer number (76198241432301).
Almost surely, 2152396482864601 is an apocalyptic number.
It is an amenable number.
152396482864601 is a deficient number, since it is larger than the sum of its proper divisors (1).
152396482864601 is an equidigital number, since it uses as much as digits as its factorization.
152396482864601 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 119439360, while the sum is 65.
The spelling of 152396482864601 in words is "one hundred fifty-two trillion, three hundred ninety-six billion, four hundred eighty-two million, eight hundred sixty-four thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •