Base | Representation |
---|---|
bin | 1000110110010010010… |
… | …1000111010110111011 |
3 | 112112100221002110121012 |
4 | 2031210211013112323 |
5 | 4442304343301202 |
6 | 153455533504135 |
7 | 13660660533251 |
oct | 2154445072673 |
9 | 475327073535 |
10 | 152011306427 |
11 | 59516468472 |
12 | 2556434204b |
13 | 11447184bc6 |
14 | 75009505d1 |
15 | 3e4a477152 |
hex | 23649475bb |
152011306427 has 2 divisors, whose sum is σ = 152011306428. Its totient is φ = 152011306426.
The previous prime is 152011306417. The next prime is 152011306429. The reversal of 152011306427 is 724603110251.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 152011306427 - 24 = 152011306411 is a prime.
Together with 152011306429, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 152011306393 and 152011306402.
It is not a weakly prime, because it can be changed into another prime (152011306429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76005653213 + 76005653214.
It is an arithmetic number, because the mean of its divisors is an integer number (76005653214).
Almost surely, 2152011306427 is an apocalyptic number.
152011306427 is a deficient number, since it is larger than the sum of its proper divisors (1).
152011306427 is an equidigital number, since it uses as much as digits as its factorization.
152011306427 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10080, while the sum is 32.
Adding to 152011306427 its reverse (724603110251), we get a palindrome (876614416678).
The spelling of 152011306427 in words is "one hundred fifty-two billion, eleven million, three hundred six thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •