Base | Representation |
---|---|
bin | 1100010100011110… |
… | …10101111010111101 |
3 | 122001221212110111000 |
4 | 12022033111322331 |
5 | 102021221320203 |
6 | 3012154120513 |
7 | 322623104163 |
oct | 61217257275 |
9 | 18057773430 |
10 | 6614245053 |
11 | 2894629229 |
12 | 1347120139 |
13 | 815411490 |
14 | 46a623233 |
15 | 28aa1b4a3 |
hex | 18a3d5ebd |
6614245053 has 16 divisors (see below), whose sum is σ = 10552642240. Its totient is φ = 4070304432.
The previous prime is 6614245037. The next prime is 6614245061. The reversal of 6614245053 is 3505424166.
6614245053 is a `hidden beast` number, since 6 + 6 + 142 + 4 + 505 + 3 = 666.
It is not a de Polignac number, because 6614245053 - 24 = 6614245037 is a prime.
It is a super-2 number, since 2×66142450532 = 87496475242269945618, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6614244999 and 6614245017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6614245003) 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, 9421651 + ... + 9422352.
It is an arithmetic number, because the mean of its divisors is an integer number (659540140).
Almost surely, 26614245053 is an apocalyptic number.
It is an amenable number.
6614245053 is a deficient number, since it is larger than the sum of its proper divisors (3938397187).
6614245053 is a wasteful number, since it uses less digits than its factorization.
6614245053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18844025 (or 18844019 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The square root of 6614245053 is about 81328.0090313294. The cubic root of 6614245053 is about 1877.1260083095.
The spelling of 6614245053 in words is "six billion, six hundred fourteen million, two hundred forty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •