Base | Representation |
---|---|
bin | 10010101001011001… |
… | …11110100000110001 |
3 | 221211200111001112200 |
4 | 21110230332200301 |
5 | 131000304323441 |
6 | 4333214413413 |
7 | 503040122226 |
oct | 112454764061 |
9 | 27750431480 |
10 | 10011011121 |
11 | 4277a55911 |
12 | 1b34801269 |
13 | c37074327 |
14 | 6ad7cb94d |
15 | 3d8d357b6 |
hex | 254b3e831 |
10011011121 has 6 divisors (see below), whose sum is σ = 14460349410. Its totient is φ = 6674007408.
The previous prime is 10011011063. The next prime is 10011011141. The reversal of 10011011121 is 12111011001.
It can be written as a sum of positive squares in only one way, i.e., 6219530496 + 3791480625 = 78864^2 + 61575^2 .
It is not a de Polignac number, because 10011011121 - 222 = 10006816817 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1112334569 = 10011011121 / (1 + 0 + 0 + 1 + 1 + 0 + 1 + 1 + 1 + 2 + 1).
It is not an unprimeable number, because it can be changed into a prime (10011011141) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 556167276 + ... + 556167293.
It is an arithmetic number, because the mean of its divisors is an integer number (2410058235).
Almost surely, 210011011121 is an apocalyptic number.
It is an amenable number.
10011011121 is a deficient number, since it is larger than the sum of its proper divisors (4449338289).
10011011121 is a wasteful number, since it uses less digits than its factorization.
10011011121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1112334575 (or 1112334572 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10011011121 its reverse (12111011001), we get a palindrome (22122022122).
The spelling of 10011011121 in words is "ten billion, eleven million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.647 sec. • engine limits •