Base | Representation |
---|---|
bin | 110011101100110111… |
… | …000000111010101001 |
3 | 12022021211100120012020 |
4 | 303230313000322221 |
5 | 1402142420432301 |
6 | 41300313535053 |
7 | 4003450362264 |
oct | 635467007251 |
9 | 168254316166 |
10 | 55513452201 |
11 | 215a7995319 |
12 | a913414489 |
13 | 53090b368c |
14 | 2988a89cdb |
15 | 169d920436 |
hex | cecdc0ea9 |
55513452201 has 8 divisors (see below), whose sum is σ = 76018421184. Its totient is φ = 36008725680.
The previous prime is 55513452161. The next prime is 55513452209. The reversal of 55513452201 is 10225431555.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 55513452201 - 219 = 55512927913 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (55513452209) 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 in 7 ways as a sum of consecutive naturals, for example, 250060485 + ... + 250060706.
It is an arithmetic number, because the mean of its divisors is an integer number (9502302648).
Almost surely, 255513452201 is an apocalyptic number.
It is an amenable number.
55513452201 is a deficient number, since it is larger than the sum of its proper divisors (20504968983).
55513452201 is a wasteful number, since it uses less digits than its factorization.
55513452201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500121231.
The product of its (nonzero) digits is 30000, while the sum is 33.
Adding to 55513452201 its reverse (10225431555), we get a palindrome (65738883756).
The spelling of 55513452201 in words is "fifty-five billion, five hundred thirteen million, four hundred fifty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •