Base | Representation |
---|---|
bin | 10101000110111000… |
… | …01001100101111001 |
3 | 1002020202011020210012 |
4 | 22203130021211321 |
5 | 141201443000441 |
6 | 5112244031305 |
7 | 550550261141 |
oct | 124334114571 |
9 | 32222136705 |
10 | 11332000121 |
11 | 4895689462 |
12 | 2243092535 |
13 | 10b794a920 |
14 | 797013921 |
15 | 464cbe9eb |
hex | 2a3709979 |
11332000121 has 32 divisors (see below), whose sum is σ = 13392583680. Its totient is φ = 9494496000.
The previous prime is 11332000117. The next prime is 11332000129. The reversal of 11332000121 is 12100023311.
11332000121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11332000121 - 22 = 11332000117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11332000096 and 11332000105.
It is not an unprimeable number, because it can be changed into a prime (11332000129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 766031 + ... + 780683.
It is an arithmetic number, because the mean of its divisors is an integer number (418518240).
Almost surely, 211332000121 is an apocalyptic number.
It is an amenable number.
11332000121 is a deficient number, since it is larger than the sum of its proper divisors (2060583559).
11332000121 is a wasteful number, since it uses less digits than its factorization.
11332000121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14817.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 11332000121 its reverse (12100023311), we get a palindrome (23432023432).
The spelling of 11332000121 in words is "eleven billion, three hundred thirty-two million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •