Base | Representation |
---|---|
bin | 1010000110101011111110… |
… | …0110101010001110001001 |
3 | 1110100002212000002011120100 |
4 | 2201222333212222032021 |
5 | 2424011240000310441 |
6 | 35343510305320013 |
7 | 2224446104635305 |
oct | 241527746521611 |
9 | 43302760064510 |
10 | 11110000010121 |
11 | 35a37a7406691 |
12 | 12b5238636009 |
13 | 62788c92573c |
14 | 2a5a2675cd05 |
15 | 143ee37a4cb6 |
hex | a1abf9aa389 |
11110000010121 has 24 divisors (see below), whose sum is σ = 16083308813000. Its totient is φ = 7390277740800.
The previous prime is 11110000010111. The next prime is 11110000010143. The reversal of 11110000010121 is 12101000001111.
It can be written as a sum of positive squares in 4 ways, for example, as 1201575514896 + 9908424495225 = 1096164^2 + 3147765^2 .
It is not a de Polignac number, because 11110000010121 - 25 = 11110000010089 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11110000010111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12969861 + ... + 13799901.
Almost surely, 211110000010121 is an apocalyptic number.
It is an amenable number.
11110000010121 is a deficient number, since it is larger than the sum of its proper divisors (4973308802879).
11110000010121 is a wasteful number, since it uses less digits than its factorization.
11110000010121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 833337 (or 833334 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11110000010121 its reverse (12101000001111), we get a palindrome (23211000011232).
The spelling of 11110000010121 in words is "eleven trillion, one hundred ten billion, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •