Base | Representation |
---|---|
bin | 10011011110000101101… |
… | …10110001110010111000 |
3 | 2100221202222221221211020 |
4 | 21233002312301302320 |
5 | 41430042200224040 |
6 | 1231155045302440 |
7 | 66222113163261 |
oct | 11570266616270 |
9 | 2327688857736 |
10 | 668989070520 |
11 | 238797987361 |
12 | a97a3104a20 |
13 | 4b11580c024 |
14 | 24544905968 |
15 | 1260683dcd0 |
hex | 9bc2db1cb8 |
668989070520 has 192 divisors, whose sum is σ = 2122293687840. Its totient is φ = 168677683200.
The previous prime is 668989070483. The next prime is 668989070527. The reversal of 668989070520 is 25070989866.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (668989070527) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 22554900 + ... + 22584540.
Almost surely, 2668989070520 is an apocalyptic number.
668989070520 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 668989070520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1061146843920).
668989070520 is an abundant number, since it is smaller than the sum of its proper divisors (1453304617320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
668989070520 is a wasteful number, since it uses less digits than its factorization.
668989070520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30214 (or 30191 counting only the distinct ones).
The product of its (nonzero) digits is 13063680, while the sum is 60.
The spelling of 668989070520 in words is "six hundred sixty-eight billion, nine hundred eighty-nine million, seventy thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •