Base | Representation |
---|---|
bin | 10000000010101101100… |
… | …11110000101011100001 |
3 | 1221200202221001012110222 |
4 | 20001112303300223201 |
5 | 33012340312120301 |
6 | 1101120130532425 |
7 | 54552360406463 |
oct | 10012663605341 |
9 | 1850687035428 |
10 | 551212223201 |
11 | 1a2849a25802 |
12 | 8a9b3a37115 |
13 | 3cc960a1723 |
14 | 1c970946133 |
15 | e511b2a31b |
hex | 8056cf0ae1 |
551212223201 has 4 divisors (see below), whose sum is σ = 552491138304. Its totient is φ = 549933308100.
The previous prime is 551212223197. The next prime is 551212223227. The reversal of 551212223201 is 102322212155.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 551212223201 - 22 = 551212223197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (551212229201) 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 in 3 ways as a sum of consecutive naturals, for example, 639456905 + ... + 639457766.
It is an arithmetic number, because the mean of its divisors is an integer number (138122784576).
Almost surely, 2551212223201 is an apocalyptic number.
It is an amenable number.
551212223201 is a deficient number, since it is larger than the sum of its proper divisors (1278915103).
551212223201 is a wasteful number, since it uses less digits than its factorization.
551212223201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1278915102.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 551212223201 its reverse (102322212155), we get a palindrome (653534435356).
The spelling of 551212223201 in words is "five hundred fifty-one billion, two hundred twelve million, two hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •