Base | Representation |
---|---|
bin | 10101000011000110… |
… | …00000011010110001 |
3 | 1002011112101211101000 |
4 | 22201203000122301 |
5 | 141120330234441 |
6 | 5105151232213 |
7 | 550013324136 |
oct | 124143003261 |
9 | 32145354330 |
10 | 11300243121 |
11 | 4879768a02 |
12 | 2234518669 |
13 | 10b11abcbb |
14 | 792b0858d |
15 | 4620ea2b6 |
hex | 2a18c06b1 |
11300243121 has 16 divisors (see below), whose sum is σ = 16744523200. Its totient is φ = 7531955424.
The previous prime is 11300243117. The next prime is 11300243159. The reversal of 11300243121 is 12134200311.
11300243121 is a `hidden beast` number, since 1 + 1 + 300 + 243 + 121 = 666.
It is not a de Polignac number, because 11300243121 - 22 = 11300243117 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11300243094 and 11300243103.
It is not an unprimeable number, because it can be changed into a prime (11300243221) 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 15 ways as a sum of consecutive naturals, for example, 100470 + ... + 180816.
It is an arithmetic number, because the mean of its divisors is an integer number (1046532700).
Almost surely, 211300243121 is an apocalyptic number.
It is an amenable number.
11300243121 is a deficient number, since it is larger than the sum of its proper divisors (5444280079).
11300243121 is an equidigital number, since it uses as much as digits as its factorization.
11300243121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85565 (or 85559 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 11300243121 its reverse (12134200311), we get a palindrome (23434443432).
The spelling of 11300243121 in words is "eleven billion, three hundred million, two hundred forty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •