Base | Representation |
---|---|
bin | 1010010000011100… |
… | …01011110100000101 |
3 | 112012202201120012012 |
4 | 11020032023310011 |
5 | 42234200122003 |
6 | 2310230304005 |
7 | 253313466224 |
oct | 51016136405 |
9 | 15182646165 |
10 | 5506645253 |
11 | 23763a309a |
12 | 10981b8005 |
13 | 699acc595 |
14 | 3a34a6cbb |
15 | 2236838d8 |
hex | 14838bd05 |
5506645253 has 16 divisors (see below), whose sum is σ = 5942208960. Its totient is φ = 5083948800.
The previous prime is 5506645247. The next prime is 5506645279. The reversal of 5506645253 is 3525466055.
It is a cyclic number.
It is not a de Polignac number, because 5506645253 - 228 = 5238209797 is a prime.
It is a Smith number, since the sum of its digits (41) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5506645253.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5506645153) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 386018 + ... + 400028.
It is an arithmetic number, because the mean of its divisors is an integer number (371388060).
Almost surely, 25506645253 is an apocalyptic number.
It is an amenable number.
5506645253 is a deficient number, since it is larger than the sum of its proper divisors (435563707).
5506645253 is a wasteful number, since it uses less digits than its factorization.
5506645253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14468.
The product of its (nonzero) digits is 540000, while the sum is 41.
The square root of 5506645253 is about 74206.7736328699. The cubic root of 5506645253 is about 1765.8847923854.
The spelling of 5506645253 in words is "five billion, five hundred six million, six hundred forty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •