Base | Representation |
---|---|
bin | 10010110101010100… |
… | …11001111000111001 |
3 | 222002122122000122222 |
4 | 21122222121320321 |
5 | 131201404000441 |
6 | 4351145453425 |
7 | 505363040315 |
oct | 113252317071 |
9 | 28078560588 |
10 | 10111000121 |
11 | 431943a052 |
12 | 1b621a1275 |
13 | c519b2b11 |
14 | 6bcbb8b45 |
15 | 3e29d6d4b |
hex | 25aa99e39 |
10111000121 has 8 divisors (see below), whose sum is σ = 10803984840. Its totient is φ = 9428928768.
The previous prime is 10111000073. The next prime is 10111000153. The reversal of 10111000121 is 12100011101.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1393976896 + 8717023225 = 37336^2 + 93365^2 .
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 10111000121 - 26 = 10111000057 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10111000099 and 10111000108.
It is not an unprimeable number, because it can be changed into a prime (10111000171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2726426 + ... + 2730131.
It is an arithmetic number, because the mean of its divisors is an integer number (1350498105).
Almost surely, 210111000121 is an apocalyptic number.
It is an amenable number.
10111000121 is a deficient number, since it is larger than the sum of its proper divisors (692984719).
10111000121 is a wasteful number, since it uses less digits than its factorization.
10111000121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5456683.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 10111000121 its reverse (12100011101), we get a palindrome (22211011222).
The spelling of 10111000121 in words is "ten billion, one hundred eleven million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •