Base | Representation |
---|---|
bin | 1010010101111010… |
… | …10001010111100001 |
3 | 112022222002102100012 |
4 | 11022331101113201 |
5 | 42332422340301 |
6 | 2314550134305 |
7 | 254411560412 |
oct | 51275212741 |
9 | 15288072305 |
10 | 5552543201 |
11 | 239a2a1987 |
12 | 10ab651395 |
13 | 6a647c82a |
14 | 3a9613809 |
15 | 2276ecebb |
hex | 14af515e1 |
5552543201 has 2 divisors, whose sum is σ = 5552543202. Its totient is φ = 5552543200.
The previous prime is 5552543177. The next prime is 5552543209. The reversal of 5552543201 is 1023452555.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5513805025 + 38738176 = 74255^2 + 6224^2 .
It is a cyclic number.
It is not a de Polignac number, because 5552543201 - 226 = 5485434337 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 (5552543209) 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, 2776271600 + 2776271601.
It is an arithmetic number, because the mean of its divisors is an integer number (2776271601).
Almost surely, 25552543201 is an apocalyptic number.
It is an amenable number.
5552543201 is a deficient number, since it is larger than the sum of its proper divisors (1).
5552543201 is an equidigital number, since it uses as much as digits as its factorization.
5552543201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30000, while the sum is 32.
The square root of 5552543201 is about 74515.3890213290. The cubic root of 5552543201 is about 1770.7774469916. Note that the first 3 decimals are identical.
Adding to 5552543201 its reverse (1023452555), we get a palindrome (6575995756).
The spelling of 5552543201 in words is "five billion, five hundred fifty-two million, five hundred forty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •