Base | Representation |
---|---|
bin | 1000110011010000111… |
… | …0001111000010011001 |
3 | 112110021101110221102112 |
4 | 2030310032033002121 |
5 | 4434124200032301 |
6 | 153243232442105 |
7 | 13631606545643 |
oct | 2146416170231 |
9 | 473241427375 |
10 | 151200002201 |
11 | 5913a506606 |
12 | 253786a9335 |
13 | 11348074931 |
14 | 7464cc1893 |
15 | 3dee11a9bb |
hex | 233438f099 |
151200002201 has 2 divisors, whose sum is σ = 151200002202. Its totient is φ = 151200002200.
The previous prime is 151200002081. The next prime is 151200002227. The reversal of 151200002201 is 102200002151.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 119146470976 + 32053531225 = 345176^2 + 179035^2 .
It is a cyclic number.
It is not a de Polignac number, because 151200002201 - 226 = 151132893337 is a prime.
It is a super-4 number, since 4×1512000022014 (a number of 46 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (151200004201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75600001100 + 75600001101.
It is an arithmetic number, because the mean of its divisors is an integer number (75600001101).
Almost surely, 2151200002201 is an apocalyptic number.
It is an amenable number.
151200002201 is a deficient number, since it is larger than the sum of its proper divisors (1).
151200002201 is an equidigital number, since it uses as much as digits as its factorization.
151200002201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40, while the sum is 14.
Adding to 151200002201 its reverse (102200002151), we get a palindrome (253400004352).
The spelling of 151200002201 in words is "one hundred fifty-one billion, two hundred million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •