Base | Representation |
---|---|
bin | 10011011110011010… |
… | …10001010000000000 |
3 | 222222200012210012010 |
4 | 21233031101100000 |
5 | 132403123342341 |
6 | 4445301332520 |
7 | 520046564004 |
oct | 115715212000 |
9 | 28880183163 |
10 | 10455684096 |
11 | 4485a63240 |
12 | 2039707140 |
13 | ca8227430 |
14 | 7128a0704 |
15 | 412dc0716 |
hex | 26f351400 |
10455684096 has 176 divisors, whose sum is σ = 32741650368. Its totient is φ = 2924544000.
The previous prime is 10455684079. The next prime is 10455684101. The reversal of 10455684096 is 69048655401.
It is a tau number, because it is divible by the number of its divisors (176).
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 15 ways as a sum of consecutive naturals, for example, 427396 + ... + 451196.
Almost surely, 210455684096 is an apocalyptic number.
10455684096 is a gapful number since it is divisible by the number (16) 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 10455684096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16370825184).
10455684096 is an abundant number, since it is smaller than the sum of its proper divisors (22285966272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10455684096 is a wasteful number, since it uses less digits than its factorization.
10455684096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23848 (or 23830 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 48.
The spelling of 10455684096 in words is "ten billion, four hundred fifty-five million, six hundred eighty-four thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •