Base | Representation |
---|---|
bin | 1000110011010000111… |
… | …1001011010110001011 |
3 | 112110021101221111021122 |
4 | 2030310033023112023 |
5 | 4434124230433402 |
6 | 153243242025455 |
7 | 13631611625066 |
oct | 2146417132613 |
9 | 473241844248 |
10 | 151200249227 |
11 | 5913a665165 |
12 | 253787a828b |
13 | 113481301c1 |
14 | 7464d478dd |
15 | 3dee168ca2 |
hex | 23343cb58b |
151200249227 has 2 divisors, whose sum is σ = 151200249228. Its totient is φ = 151200249226.
The previous prime is 151200249197. The next prime is 151200249241. The reversal of 151200249227 is 722942002151.
151200249227 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 151200249227 - 222 = 151196054923 is a prime.
It is not a weakly prime, because it can be changed into another prime (151200249727) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75600124613 + 75600124614.
It is an arithmetic number, because the mean of its divisors is an integer number (75600124614).
Almost surely, 2151200249227 is an apocalyptic number.
151200249227 is a deficient number, since it is larger than the sum of its proper divisors (1).
151200249227 is an equidigital number, since it uses as much as digits as its factorization.
151200249227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20160, while the sum is 35.
The spelling of 151200249227 in words is "one hundred fifty-one billion, two hundred million, two hundred forty-nine thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •