Base | Representation |
---|---|
bin | 10101000010110111… |
… | …01100001010000000 |
3 | 1002011101210101100221 |
4 | 22201123230022000 |
5 | 141114332400440 |
6 | 5105042152424 |
7 | 546661115245 |
oct | 124133541200 |
9 | 32141711327 |
10 | 11298325120 |
11 | 4878678985 |
12 | 2233952714 |
13 | 10b0989ca4 |
14 | 7927695cc |
15 | 461d6bd4a |
hex | 2a16ec280 |
11298325120 has 64 divisors (see below), whose sum is σ = 28598913000. Its totient is φ = 4253483008.
The previous prime is 11298325063. The next prime is 11298325127. The reversal of 11298325120 is 2152389211.
It can be written as a sum of positive squares in 4 ways, for example, as 7672358464 + 3625966656 = 87592^2 + 60216^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (34).
It is not an unprimeable number, because it can be changed into a prime (11298325127) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 508345 + ... + 530104.
Almost surely, 211298325120 is an apocalyptic number.
11298325120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11298325120 is an abundant number, since it is smaller than the sum of its proper divisors (17300587880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11298325120 is a wasteful number, since it uses less digits than its factorization.
11298325120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1038485 (or 1038473 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 34.
The spelling of 11298325120 in words is "eleven billion, two hundred ninety-eight million, three hundred twenty-five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •