Base | Representation |
---|---|
bin | 10011100011000101… |
… | …11011100000000000 |
3 | 1000002102001000002010 |
4 | 21301202323200000 |
5 | 132443144312413 |
6 | 4453222252520 |
7 | 521034214341 |
oct | 116142734000 |
9 | 30072030063 |
10 | 10494916608 |
11 | 44a611a200 |
12 | 204a887140 |
13 | cb33b2837 |
14 | 717b940c8 |
15 | 41656edc3 |
hex | 2718bb800 |
10494916608 has 288 divisors, whose sum is σ = 32416675200. Its totient is φ = 3008839680.
The previous prime is 10494916547. The next prime is 10494916643. The reversal of 10494916608 is 80661949401.
It is a super-2 number, since 2×104949166082 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14124685 + ... + 14125427.
It is an arithmetic number, because the mean of its divisors is an integer number (112557900).
Almost surely, 210494916608 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10494916608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16208337600).
10494916608 is an abundant number, since it is smaller than the sum of its proper divisors (21921758592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10494916608 is a wasteful number, since it uses less digits than its factorization.
10494916608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 809 (or 778 counting only the distinct ones).
The product of its (nonzero) digits is 373248, while the sum is 48.
The spelling of 10494916608 in words is "ten billion, four hundred ninety-four million, nine hundred sixteen thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •