Base | Representation |
---|---|
bin | 10010110101100101… |
… | …11010100100010001 |
3 | 222002210211101000121 |
4 | 21122302322210101 |
5 | 131202441343441 |
6 | 4351305350241 |
7 | 505421021560 |
oct | 113262724421 |
9 | 28083741017 |
10 | 10113231121 |
11 | 431a723254 |
12 | 1b62a98381 |
13 | c522b4436 |
14 | 6bd1d9bd7 |
15 | 3e2cc7dd1 |
hex | 25acba911 |
10113231121 has 8 divisors (see below), whose sum is σ = 11558969280. Its totient is φ = 8667740688.
The previous prime is 10113231113. The next prime is 10113231187. The reversal of 10113231121 is 12113231101.
It is a happy number.
10113231121 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 10113231121 - 23 = 10113231113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10113231095 and 10113231104.
It is not an unprimeable number, because it can be changed into a prime (10113231221) 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, 35850 + ... + 146668.
It is an arithmetic number, because the mean of its divisors is an integer number (1444871160).
Almost surely, 210113231121 is an apocalyptic number.
It is an amenable number.
10113231121 is a deficient number, since it is larger than the sum of its proper divisors (1445738159).
10113231121 is a wasteful number, since it uses less digits than its factorization.
10113231121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 123863.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 10113231121 its reverse (12113231101), we get a palindrome (22226462222).
The spelling of 10113231121 in words is "ten billion, one hundred thirteen million, two hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •