Base | Representation |
---|---|
bin | 100000100011011011… |
… | …1011011110010101000 |
3 | 20200110001000100222000 |
4 | 1001012313123302220 |
5 | 2121133023213413 |
6 | 52040535531000 |
7 | 5023252465635 |
oct | 1010667336250 |
9 | 220401010860 |
10 | 69908413608 |
11 | 27714527940 |
12 | 11670229a60 |
13 | 679148b617 |
14 | 35527b518c |
15 | 1c4256e073 |
hex | 1046ddbca8 |
69908413608 has 512 divisors, whose sum is σ = 238458816000. Its totient is φ = 18718801920.
The previous prime is 69908413583. The next prime is 69908413609. The reversal of 69908413608 is 80631480996.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (69908413609) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 43339810 + ... + 43341422.
It is an arithmetic number, because the mean of its divisors is an integer number (465739875).
Almost surely, 269908413608 is an apocalyptic number.
69908413608 is a gapful number since it is divisible by the number (68) 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 69908413608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119229408000).
69908413608 is an abundant number, since it is smaller than the sum of its proper divisors (168550402392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69908413608 is a wasteful number, since it uses less digits than its factorization.
69908413608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1722 (or 1712 counting only the distinct ones).
The product of its (nonzero) digits is 2239488, while the sum is 54.
The spelling of 69908413608 in words is "sixty-nine billion, nine hundred eight million, four hundred thirteen thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •