Base | Representation |
---|---|
bin | 10101000010001110… |
… | …11100111101100000 |
3 | 1002011000210212010000 |
4 | 22201013130331200 |
5 | 141112003120000 |
6 | 5104332340000 |
7 | 546565041363 |
oct | 124107347540 |
9 | 32130725100 |
10 | 11293020000 |
11 | 4875685089 |
12 | 2232014600 |
13 | 10ac850372 |
14 | 791b880da |
15 | 461670000 |
hex | 2a11dcf60 |
11293020000 has 300 divisors, whose sum is σ = 41508241236. Its totient is φ = 3011040000.
The previous prime is 11293019999. The next prime is 11293020019. The reversal of 11293020000 is 2039211.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (300).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 49 ways as a sum of consecutive naturals, for example, 1616515 + ... + 1623485.
Almost surely, 211293020000 is an apocalyptic number.
11293020000 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 11293020000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20754120618).
11293020000 is an abundant number, since it is smaller than the sum of its proper divisors (30215221236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11293020000 is an frugal number, since it uses more digits than its factorization.
11293020000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7013 (or 6981 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 11293020000 its reverse (2039211), we get a palindrome (11295059211).
The spelling of 11293020000 in words is "eleven billion, two hundred ninety-three million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •