Base | Representation |
---|---|
bin | 1010100011010001… |
… | …11101101001010101 |
3 | 112121210001112202012 |
4 | 11101220331221111 |
5 | 43100123110203 |
6 | 2334033154005 |
7 | 260242546613 |
oct | 52150755125 |
9 | 15553045665 |
10 | 5664660053 |
11 | 2447609a38 |
12 | 11210bb905 |
13 | 6c3776570 |
14 | 3ba47a6b3 |
15 | 232497bd8 |
hex | 151a3da55 |
5664660053 has 8 divisors (see below), whose sum is σ = 6110363448. Its totient is φ = 5220379584.
The previous prime is 5664660037. The next prime is 5664660119. The reversal of 5664660053 is 3500664665.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 3301489 + 5661358564 = 1817^2 + 75242^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5664660053 - 24 = 5664660037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5664660653) 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 7 ways as a sum of consecutive naturals, for example, 347450 + ... + 363387.
It is an arithmetic number, because the mean of its divisors is an integer number (763795431).
Almost surely, 25664660053 is an apocalyptic number.
It is an amenable number.
5664660053 is a deficient number, since it is larger than the sum of its proper divisors (445703395).
5664660053 is a wasteful number, since it uses less digits than its factorization.
5664660053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 711463.
The product of its (nonzero) digits is 388800, while the sum is 41.
The square root of 5664660053 is about 75263.9359388014. The cubic root of 5664660053 is about 1782.6166176169.
The spelling of 5664660053 in words is "five billion, six hundred sixty-four million, six hundred sixty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •