Base | Representation |
---|---|
bin | 1000110010100010100… |
… | …0000110001100001001 |
3 | 112102202211101220222211 |
4 | 2030220220012030021 |
5 | 4433224344030423 |
6 | 153212042545121 |
7 | 13624025122162 |
oct | 2145050061411 |
9 | 472684356884 |
10 | 151005455113 |
11 | 5904a708497 |
12 | 253235081a1 |
13 | 11316979606 |
14 | 744711c769 |
15 | 3ddbedc10d |
hex | 2328a06309 |
151005455113 has 2 divisors, whose sum is σ = 151005455114. Its totient is φ = 151005455112.
The previous prime is 151005455077. The next prime is 151005455149. The reversal of 151005455113 is 311554500151.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (151005455077) and next prime (151005455149).
It can be written as a sum of positive squares in only one way, i.e., 102776024569 + 48229430544 = 320587^2 + 219612^2 .
It is a cyclic number.
It is not a de Polignac number, because 151005455113 - 29 = 151005454601 is a prime.
It is not a weakly prime, because it can be changed into another prime (151005455213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75502727556 + 75502727557.
It is an arithmetic number, because the mean of its divisors is an integer number (75502727557).
Almost surely, 2151005455113 is an apocalyptic number.
It is an amenable number.
151005455113 is a deficient number, since it is larger than the sum of its proper divisors (1).
151005455113 is an equidigital number, since it uses as much as digits as its factorization.
151005455113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7500, while the sum is 31.
Adding to 151005455113 its reverse (311554500151), we get a palindrome (462559955264).
The spelling of 151005455113 in words is "one hundred fifty-one billion, five million, four hundred fifty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •