Base | Representation |
---|---|
bin | 10100100011010111… |
… | …10100111101000000 |
3 | 1001110222122101002010 |
4 | 22101223310331000 |
5 | 140044213320000 |
6 | 5022523252520 |
7 | 540302321031 |
oct | 122153647500 |
9 | 31428571063 |
10 | 11034120000 |
11 | 4752522742 |
12 | 217b37a140 |
13 | 106b0129b7 |
14 | 769632a88 |
15 | 448a7dd50 |
hex | 291af4f40 |
11034120000 has 140 divisors (see below), whose sum is σ = 36481772096. Its totient is φ = 2942400000.
The previous prime is 11034119989. The next prime is 11034120001. The reversal of 11034120000 is 2143011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11034120001) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 74025 + ... + 165975.
Almost surely, 211034120000 is an apocalyptic number.
11034120000 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 11034120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18240886048).
11034120000 is an abundant number, since it is smaller than the sum of its proper divisors (25447652096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11034120000 is an frugal number, since it uses more digits than its factorization.
11034120000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91986 (or 91961 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 11034120000 its reverse (2143011), we get a palindrome (11036263011).
The spelling of 11034120000 in words is "eleven billion, thirty-four million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •