Base | Representation |
---|---|
bin | 10100100000111111… |
… | …00001111010100000 |
3 | 1001102121000012222000 |
4 | 22100133201322200 |
5 | 140024103302242 |
6 | 5020530444000 |
7 | 536640316215 |
oct | 122037417240 |
9 | 31377005860 |
10 | 11014119072 |
11 | 4742201750 |
12 | 2174733600 |
13 | 1066b2c028 |
14 | 766b07b0c |
15 | 446e2ca4c |
hex | 2907e1ea0 |
11014119072 has 192 divisors, whose sum is σ = 35861253120. Its totient is φ = 3259872000.
The previous prime is 11014119059. The next prime is 11014119097. The reversal of 11014119072 is 27091141011.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 395197 + ... + 422147.
It is an arithmetic number, because the mean of its divisors is an integer number (186777360).
Almost surely, 211014119072 is an apocalyptic number.
11014119072 is a gapful number since it is divisible by the number (12) 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 11014119072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17930626560).
11014119072 is an abundant number, since it is smaller than the sum of its proper divisors (24847134048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11014119072 is a wasteful number, since it uses less digits than its factorization.
11014119072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27024 (or 27010 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 27.
The spelling of 11014119072 in words is "eleven billion, fourteen million, one hundred nineteen thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •