Base | Representation |
---|---|
bin | 10100101011010101… |
… | …11101000110111001 |
3 | 1001122122111020100122 |
4 | 22111222331012321 |
5 | 140213324000441 |
6 | 5033312543025 |
7 | 542043641561 |
oct | 122552750671 |
9 | 31578436318 |
10 | 11101000121 |
11 | 4787252772 |
12 | 2199851a75 |
13 | 107bb2b433 |
14 | 774481da1 |
15 | 44e89034b |
hex | 295abd1b9 |
11101000121 has 8 divisors (see below), whose sum is σ = 11151544320. Its totient is φ = 11050513408.
The previous prime is 11101000109. The next prime is 11101000159. The reversal of 11101000121 is 12100010111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11101000121 - 210 = 11100999097 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 = 11101000099 and 11101000108.
It is not an unprimeable number, because it can be changed into a prime (11101000181) 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 7 ways as a sum of consecutive naturals, for example, 399560 + ... + 426438.
It is an arithmetic number, because the mean of its divisors is an integer number (1393943040).
Almost surely, 211101000121 is an apocalyptic number.
It is an amenable number.
11101000121 is a deficient number, since it is larger than the sum of its proper divisors (50544199).
11101000121 is a wasteful number, since it uses less digits than its factorization.
11101000121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28743.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 11101000121 its reverse (12100010111), we get a palindrome (23201010232).
The spelling of 11101000121 in words is "eleven billion, one hundred one million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •