Base | Representation |
---|---|
bin | 111000011001111101… |
… | …1011110000110110001 |
3 | 102120122210001102020001 |
4 | 1300303323132012301 |
5 | 3441033324441423 |
6 | 131351350550001 |
7 | 11515502443666 |
oct | 1606373360661 |
9 | 376583042201 |
10 | 121130312113 |
11 | 474099a3368 |
12 | 1b586368301 |
13 | b56541c0c5 |
14 | 5c114d5a6d |
15 | 323e327cad |
hex | 1c33ede1b1 |
121130312113 has 4 divisors (see below), whose sum is σ = 125037741568. Its totient is φ = 117222882660.
The previous prime is 121130312089. The next prime is 121130312119. The reversal of 121130312113 is 311213031121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 311213031121 = 517499 ⋅601379.
It is a cyclic number.
It is not a de Polignac number, because 121130312113 - 229 = 120593441201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121130312119) 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, 1953714681 + ... + 1953714742.
It is an arithmetic number, because the mean of its divisors is an integer number (31259435392).
Almost surely, 2121130312113 is an apocalyptic number.
It is an amenable number.
121130312113 is a deficient number, since it is larger than the sum of its proper divisors (3907429455).
121130312113 is an equidigital number, since it uses as much as digits as its factorization.
121130312113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3907429454.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 121130312113 its reverse (311213031121), we get a palindrome (432343343234).
The spelling of 121130312113 in words is "one hundred twenty-one billion, one hundred thirty million, three hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •