Base | Representation |
---|---|
bin | 110000000110111101000… |
… | …1001100110011110110101 |
3 | 212102002201221001021200100 |
4 | 1200031322021212132311 |
5 | 1331312341011141223 |
6 | 22021302424504313 |
7 | 1251462423505533 |
oct | 140157211463665 |
9 | 25362657037610 |
10 | 6612004005813 |
11 | 211a153983208 |
12 | 8a954a91b099 |
13 | 38c680c2520b |
14 | 18c046415153 |
15 | b6ed7ab8043 |
hex | 6037a2667b5 |
6612004005813 has 12 divisors (see below), whose sum is σ = 9574729567468. Its totient is φ = 4396899386880.
The previous prime is 6612004005797. The next prime is 6612004005821. The reversal of 6612004005813 is 3185004002166.
It is a happy number.
6612004005813 is a `hidden beast` number, since 66 + 12 + 0 + 0 + 4 + 0 + 0 + 581 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 4947679538244 + 1664324467569 = 2224338^2 + 1290087^2 .
It is not a de Polignac number, because 6612004005813 - 24 = 6612004005797 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 (6612004405813) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 925269868 + ... + 925277013.
Almost surely, 26612004005813 is an apocalyptic number.
It is an amenable number.
6612004005813 is a deficient number, since it is larger than the sum of its proper divisors (2962725561655).
6612004005813 is a wasteful number, since it uses less digits than its factorization.
6612004005813 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1850547284 (or 1850547281 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
Adding to 6612004005813 its reverse (3185004002166), we get a palindrome (9797008007979).
The spelling of 6612004005813 in words is "six trillion, six hundred twelve billion, four million, five thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •