Base | Representation |
---|---|
bin | 10100111110110000… |
… | …11110111011100000 |
3 | 1002002000001221020120 |
4 | 22133120132323200 |
5 | 141032031230310 |
6 | 5101413040240 |
7 | 546062553204 |
oct | 123730367340 |
9 | 32060057216 |
10 | 11263930080 |
11 | 4860216427 |
12 | 2224326080 |
13 | 10a68066b0 |
14 | 78bd74b04 |
15 | 45dd25b70 |
hex | 29f61eee0 |
11263930080 has 96 divisors (see below), whose sum is σ = 38210737824. Its totient is φ = 2772658176.
The previous prime is 11263930063. The next prime is 11263930087. The reversal of 11263930080 is 8003936211.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×112639300802 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11263930087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 896319 + ... + 908798.
It is an arithmetic number, because the mean of its divisors is an integer number (398028519).
Almost surely, 211263930080 is an apocalyptic number.
11263930080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11263930080 is an abundant number, since it is smaller than the sum of its proper divisors (26946807744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11263930080 is a wasteful number, since it uses less digits than its factorization.
11263930080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1805148 (or 1805140 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 33.
The spelling of 11263930080 in words is "eleven billion, two hundred sixty-three million, nine hundred thirty thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •