Base | Representation |
---|---|
bin | 10100100100111001… |
… | …10101100110000000 |
3 | 1001111212211002210010 |
4 | 22102130311212000 |
5 | 140111010431210 |
6 | 5024102504520 |
7 | 540516450600 |
oct | 122234654600 |
9 | 31455732703 |
10 | 11046967680 |
11 | 47597a8361 |
12 | 2183735140 |
13 | 1070890788 |
14 | 76b218c00 |
15 | 449c6a920 |
hex | 292735980 |
11046967680 has 384 divisors, whose sum is σ = 42384060000. Its totient is φ = 2437349376.
The previous prime is 11046967661. The next prime is 11046967681. The reversal of 11046967680 is 8676964011.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (384).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11046967681) 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, 2726296 + ... + 2730344.
Almost surely, 211046967680 is an apocalyptic number.
11046967680 is a gapful number since it is divisible by the number (10) 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 11046967680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21192030000).
11046967680 is an abundant number, since it is smaller than the sum of its proper divisors (31337092320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11046967680 is a wasteful number, since it uses less digits than its factorization.
11046967680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4114 (or 4095 counting only the distinct ones).
The product of its (nonzero) digits is 435456, while the sum is 48.
The spelling of 11046967680 in words is "eleven billion, forty-six million, nine hundred sixty-seven thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •