Base | Representation |
---|---|
bin | 10101010100001001… |
… | …10101110000100000 |
3 | 1002112111122101210000 |
4 | 22222010311300200 |
5 | 141413443030310 |
6 | 5131302140000 |
7 | 553401462240 |
oct | 125204656040 |
9 | 32474571700 |
10 | 11443330080 |
11 | 4942509296 |
12 | 2274421600 |
13 | 1104a2a440 |
14 | 7a7b13b20 |
15 | 46e9614c0 |
hex | 2aa135c20 |
11443330080 has 960 divisors, whose sum is σ = 51472447488. Its totient is φ = 2329067520.
The previous prime is 11443330033. The next prime is 11443330091. The reversal of 11443330080 is 8003334411.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 159 ways as a sum of consecutive naturals, for example, 36560004 + ... + 36560316.
Almost surely, 211443330080 is an apocalyptic number.
11443330080 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 11443330080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25736223744).
11443330080 is an abundant number, since it is smaller than the sum of its proper divisors (40029117408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11443330080 is a wasteful number, since it uses less digits than its factorization.
11443330080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391 (or 374 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 11443330080 its reverse (8003334411), we get a palindrome (19446664491).
The spelling of 11443330080 in words is "eleven billion, four hundred forty-three million, three hundred thirty thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •