Base | Representation |
---|---|
bin | 10011011100010101111… |
… | …01010011011010110000 |
3 | 2100212100122022002112110 |
4 | 21232022331103122300 |
5 | 41421132110211013 |
6 | 1230522024525320 |
7 | 66156634664142 |
oct | 11561275233260 |
9 | 2325318262473 |
10 | 668051257008 |
11 | 238356578173 |
12 | a9581020840 |
13 | 4acc64360a5 |
14 | 24496144c92 |
15 | 1259e3432c3 |
hex | 9b8af536b0 |
668051257008 has 20 divisors (see below), whose sum is σ = 1725799080728. Its totient is φ = 222683752320.
The previous prime is 668051257007. The next prime is 668051257031. The reversal of 668051257008 is 800752150866.
It is a super-2 number, since 2×6680512570082 (a number of 24 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (48) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (48), and also a Moran number because the ratio is a prime number: 13917734521 = 668051257008 / (6 + 6 + 8 + 0 + 5 + 1 + 2 + 5 + 7 + 0 + 0 + 8).
It is not an unprimeable number, because it can be changed into a prime (668051257001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6958867213 + ... + 6958867308.
Almost surely, 2668051257008 is an apocalyptic number.
It is an amenable number.
668051257008 is an abundant number, since it is smaller than the sum of its proper divisors (1057747823720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
668051257008 is a wasteful number, since it uses less digits than its factorization.
668051257008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13917734532 (or 13917734526 counting only the distinct ones).
The product of its (nonzero) digits is 806400, while the sum is 48.
The spelling of 668051257008 in words is "six hundred sixty-eight billion, fifty-one million, two hundred fifty-seven thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •