Base | Representation |
---|---|
bin | 10101000011100011… |
… | …00001010000110000 |
3 | 1002011210120010020000 |
4 | 22201301201100300 |
5 | 141122314011124 |
6 | 5105404550000 |
7 | 550060551120 |
oct | 124161412060 |
9 | 32153503200 |
10 | 11304047664 |
11 | 4880927358 |
12 | 2235852300 |
13 | 10b1c11900 |
14 | 793418c80 |
15 | 4625ec6c9 |
hex | 2a1c61430 |
11304047664 has 600 divisors, whose sum is σ = 41449570272. Its totient is φ = 2911334400.
The previous prime is 11304047653. The next prime is 11304047747. The reversal of 11304047664 is 46674040311.
It is a super-3 number, since 3×113040476643 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 111921214 + ... + 111921314.
Almost surely, 211304047664 is an apocalyptic number.
11304047664 is a gapful number since it is divisible by the number (14) 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 11304047664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20724785136).
11304047664 is an abundant number, since it is smaller than the sum of its proper divisors (30145522608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11304047664 is a wasteful number, since it uses less digits than its factorization.
11304047664 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 227 (or 199 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
Adding to 11304047664 its reverse (46674040311), we get a palindrome (57978087975).
The spelling of 11304047664 in words is "eleven billion, three hundred four million, forty-seven thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •