Base | Representation |
---|---|
bin | 10010110101100100… |
… | …11111101101110101 |
3 | 222002210121210011021 |
4 | 21122302133231311 |
5 | 131202424334031 |
6 | 4351303141141 |
7 | 505420053124 |
oct | 113262375565 |
9 | 28083553137 |
10 | 10113121141 |
11 | 431a658662 |
12 | 1b62a447b1 |
13 | c52276366 |
14 | 6bd1ababb |
15 | 3e2ca5511 |
hex | 25ac9fb75 |
10113121141 has 4 divisors (see below), whose sum is σ = 10114870284. Its totient is φ = 10111372000.
The previous prime is 10113121133. The next prime is 10113121153. The reversal of 10113121141 is 14112131101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7386714916 + 2726406225 = 85946^2 + 52215^2 .
It is a cyclic number.
It is not a de Polignac number, because 10113121141 - 23 = 10113121133 is a prime.
It is a super-2 number, since 2×101131211412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10113121181) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 865870 + ... + 877471.
It is an arithmetic number, because the mean of its divisors is an integer number (2528717571).
Almost surely, 210113121141 is an apocalyptic number.
It is an amenable number.
10113121141 is a deficient number, since it is larger than the sum of its proper divisors (1749143).
10113121141 is an equidigital number, since it uses as much as digits as its factorization.
10113121141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1749142.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 10113121141 its reverse (14112131101), we get a palindrome (24225252242).
The spelling of 10113121141 in words is "ten billion, one hundred thirteen million, one hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •