Base | Representation |
---|---|
bin | 111000011001101110… |
… | …0111101001110011001 |
3 | 102120122020000000122210 |
4 | 1300303130331032121 |
5 | 3441024303004423 |
6 | 131350503305333 |
7 | 11515344450204 |
oct | 1606334751631 |
9 | 376566000583 |
10 | 121122313113 |
11 | 4740542a61a |
12 | 1b58374b249 |
13 | b56387b279 |
14 | 5c1041293b |
15 | 323d797b93 |
hex | 1c3373d399 |
121122313113 has 8 divisors (see below), whose sum is σ = 161501946976. Its totient is φ = 80745444000.
The previous prime is 121122313111. The next prime is 121122313211. The reversal of 121122313113 is 311313221121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121122313113 - 21 = 121122313111 is a prime.
It is a super-2 number, since 2×1211223131132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121122313113.
It is not an unprimeable number, because it can be changed into a prime (121122313111) 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, 586708 + ... + 765813.
It is an arithmetic number, because the mean of its divisors is an integer number (20187743372).
Almost surely, 2121122313113 is an apocalyptic number.
It is an amenable number.
121122313113 is a deficient number, since it is larger than the sum of its proper divisors (40379633863).
121122313113 is a wasteful number, since it uses less digits than its factorization.
121122313113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1382375.
The product of its digits is 216, while the sum is 21.
Adding to 121122313113 its reverse (311313221121), we get a palindrome (432435534234).
The spelling of 121122313113 in words is "one hundred twenty-one billion, one hundred twenty-two million, three hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •