Base | Representation |
---|---|
bin | 1100001101001011… |
… | …01101110010011101 |
3 | 121220200121221121002 |
4 | 12012211231302131 |
5 | 101410032013432 |
6 | 3002125320045 |
7 | 321250406345 |
oct | 60645556235 |
9 | 17820557532 |
10 | 6553001117 |
11 | 2862aa8803 |
12 | 132a706025 |
13 | 80581a270 |
14 | 46243dd25 |
15 | 28546ee62 |
hex | 18696dc9d |
6553001117 has 8 divisors (see below), whose sum is σ = 7069316856. Its totient is φ = 6038433792.
The previous prime is 6553001113. The next prime is 6553001141. The reversal of 6553001117 is 7111003556.
It can be written as a sum of positive squares in 4 ways, for example, as 770007001 + 5782994116 = 27749^2 + 76046^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 6553001117 - 22 = 6553001113 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 6553001117.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6553001113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 429308 + ... + 444309.
It is an arithmetic number, because the mean of its divisors is an integer number (883664607).
Almost surely, 26553001117 is an apocalyptic number.
It is an amenable number.
6553001117 is a deficient number, since it is larger than the sum of its proper divisors (516315739).
6553001117 is a wasteful number, since it uses less digits than its factorization.
6553001117 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 874207.
The product of its (nonzero) digits is 3150, while the sum is 29.
The square root of 6553001117 is about 80950.6091206237. The cubic root of 6553001117 is about 1871.3143473176.
The spelling of 6553001117 in words is "six billion, five hundred fifty-three million, one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •