Base | Representation |
---|---|
bin | 110000011110010101100… |
… | …0011010010001011000000 |
3 | 212120220100022211012001120 |
4 | 1200330223003102023000 |
5 | 1333123204414312443 |
6 | 22100325142032240 |
7 | 1255220636243010 |
oct | 140745303221300 |
9 | 25526308735046 |
10 | 6662216557248 |
11 | 21394806212aa |
12 | 8b7222a18680 |
13 | 394323a25205 |
14 | 19064b073c40 |
15 | b8475e46083 |
hex | 60f2b0d22c0 |
6662216557248 has 112 divisors (see below), whose sum is σ = 20257818036480. Its totient is φ = 1892856351744.
The previous prime is 6662216557247. The next prime is 6662216557277. The reversal of 6662216557248 is 8427556122666.
It is a tau number, because it is divible by the number of its divisors (112).
It is a super-2 number, since 2×66622165572482 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 6662216557191 and 6662216557200.
It is not an unprimeable number, because it can be changed into a prime (6662216557247) 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 15 ways as a sum of consecutive naturals, for example, 13605811 + ... + 14086962.
Almost surely, 26662216557248 is an apocalyptic number.
It is an amenable number.
6662216557248 is an abundant number, since it is smaller than the sum of its proper divisors (13595601479232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6662216557248 is a wasteful number, since it uses less digits than its factorization.
6662216557248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27692974 (or 27692964 counting only the distinct ones).
The product of its digits is 58060800, while the sum is 60.
The spelling of 6662216557248 in words is "six trillion, six hundred sixty-two billion, two hundred sixteen million, five hundred fifty-seven thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •