Base | Representation |
---|---|
bin | 11100011010100100… |
… | …01010100100000001 |
3 | 1110101011110001111202 |
4 | 32031102022210001 |
5 | 222220321014301 |
6 | 11001432550545 |
7 | 1050016332011 |
oct | 161522124401 |
9 | 43334401452 |
10 | 15255251201 |
11 | 6519212023 |
12 | 2b58b52455 |
13 | 15916a9978 |
14 | a4a0a9c41 |
15 | 5e443466b |
hex | 38d48a901 |
15255251201 has 2 divisors, whose sum is σ = 15255251202. Its totient is φ = 15255251200.
The previous prime is 15255251159. The next prime is 15255251227. The reversal of 15255251201 is 10215255251.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15093351025 + 161900176 = 122855^2 + 12724^2 .
It is a cyclic number.
It is not a de Polignac number, because 15255251201 - 222 = 15251056897 is a prime.
It is a super-2 number, since 2×152552512012 (a number of 21 digits) contains 22 as substring.
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 (15255211201) 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, 7627625600 + 7627625601.
It is an arithmetic number, because the mean of its divisors is an integer number (7627625601).
Almost surely, 215255251201 is an apocalyptic number.
It is an amenable number.
15255251201 is a deficient number, since it is larger than the sum of its proper divisors (1).
15255251201 is an equidigital number, since it uses as much as digits as its factorization.
15255251201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5000, while the sum is 29.
The spelling of 15255251201 in words is "fifteen billion, two hundred fifty-five million, two hundred fifty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •