Base | Representation |
---|---|
bin | 10100100011001001… |
… | …11000111001000000 |
3 | 1001110212012222001012 |
4 | 22101210320321000 |
5 | 140043232113440 |
6 | 5022420300052 |
7 | 540251004131 |
oct | 122144707100 |
9 | 31425188035 |
10 | 11032301120 |
11 | 47514a0135 |
12 | 217a841628 |
13 | 106a826b39 |
14 | 7692bbc88 |
15 | 44881ee65 |
hex | 291938e40 |
11032301120 has 28 divisors (see below), whose sum is σ = 26270667804. Its totient is φ = 4412920320.
The previous prime is 11032301051. The next prime is 11032301123. The reversal of 11032301120 is 2110323011.
It can be written as a sum of positive squares in 2 ways, for example, as 5420493376 + 5611807744 = 73624^2 + 74912^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11032301095 and 11032301104.
It is not an unprimeable number, because it can be changed into a prime (11032301123) 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 3 ways as a sum of consecutive naturals, for example, 17237651 + ... + 17238290.
Almost surely, 211032301120 is an apocalyptic number.
11032301120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11032301120 is an abundant number, since it is smaller than the sum of its proper divisors (15238366684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11032301120 is an equidigital number, since it uses as much as digits as its factorization.
11032301120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34475958 (or 34475948 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 11032301120 its reverse (2110323011), we get a palindrome (13142624131).
The spelling of 11032301120 in words is "eleven billion, thirty-two million, three hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •