Base | Representation |
---|---|
bin | 1000110100001110100… |
… | …0011110011111111001 |
3 | 112110221101221222221112 |
4 | 2031003220132133321 |
5 | 4440141341231023 |
6 | 153325030050105 |
7 | 13641166226021 |
oct | 2150350363771 |
9 | 473841858845 |
10 | 151458539513 |
11 | 59262440506 |
12 | 2542b1a9935 |
13 | 113897b61a8 |
14 | 748b380a81 |
15 | 3e16b89478 |
hex | 2343a1e7f9 |
151458539513 has 2 divisors, whose sum is σ = 151458539514. Its totient is φ = 151458539512.
The previous prime is 151458539503. The next prime is 151458539521. The reversal of 151458539513 is 315935854151.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 148338981904 + 3119557609 = 385148^2 + 55853^2 .
It is an emirp because it is prime and its reverse (315935854151) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 151458539513 - 210 = 151458538489 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (151458539503) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75729269756 + 75729269757.
It is an arithmetic number, because the mean of its divisors is an integer number (75729269757).
Almost surely, 2151458539513 is an apocalyptic number.
It is an amenable number.
151458539513 is a deficient number, since it is larger than the sum of its proper divisors (1).
151458539513 is an equidigital number, since it uses as much as digits as its factorization.
151458539513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1620000, while the sum is 50.
The spelling of 151458539513 in words is "one hundred fifty-one billion, four hundred fifty-eight million, five hundred thirty-nine thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •