Base | Representation |
---|---|
bin | 11011100000111101010100… |
… | …011011101100010000011111 |
3 | 120212110122102201022211212120 |
4 | 123200331110123230100133 |
5 | 111330130310222010421 |
6 | 1105212111151234023 |
7 | 34326560101160166 |
oct | 3340752433542037 |
9 | 525418381284776 |
10 | 121012120110111 |
11 | 35615a5202822a |
12 | 116a4b62218913 |
13 | 526a5176c20a9 |
14 | 21c503703c3dd |
15 | decc09e658c6 |
hex | 6e0f546ec41f |
121012120110111 has 8 divisors (see below), whose sum is σ = 161371130829744. Its totient is φ = 80663928065280.
The previous prime is 121012120110043. The next prime is 121012120110139. The reversal of 121012120110111 is 111011021210121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121012120110111 - 221 = 121012118012959 is a prime.
It is a super-2 number, since 2×1210121201101112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121012120114111) 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, 2704642600 + ... + 2704687341.
It is an arithmetic number, because the mean of its divisors is an integer number (20171391353718).
Almost surely, 2121012120110111 is an apocalyptic number.
121012120110111 is a deficient number, since it is larger than the sum of its proper divisors (40359010719633).
121012120110111 is an equidigital number, since it uses as much as digits as its factorization.
121012120110111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5409337401.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 121012120110111 its reverse (111011021210121), we get a palindrome (232023141320232).
The spelling of 121012120110111 in words is "one hundred twenty-one trillion, twelve billion, one hundred twenty million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •