Base | Representation |
---|---|
bin | 11011100000111101010011… |
… | …110101100000101001110110 |
3 | 120212110122102000111100002211 |
4 | 123200331103311200221312 |
5 | 111330130300141213420 |
6 | 1105212110152524034 |
7 | 34326556620122344 |
oct | 3340752365405166 |
9 | 525418360440084 |
10 | 121012110101110 |
11 | 35615a47411328 |
12 | 116a4b5a9b061a |
13 | 526a5155c93c7 |
14 | 21c5035994994 |
15 | decc09139e5a |
hex | 6e0f53d60a76 |
121012110101110 has 8 divisors (see below), whose sum is σ = 217821798182016. Its totient is φ = 48404844040440.
The previous prime is 121012110101059. The next prime is 121012110101111. The reversal of 121012110101110 is 11101011210121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1210121101011102 (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 (121012110101111) 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, 6050605505046 + ... + 6050605505065.
It is an arithmetic number, because the mean of its divisors is an integer number (27227724772752).
Almost surely, 2121012110101110 is an apocalyptic number.
121012110101110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121012110101110 is a deficient number, since it is larger than the sum of its proper divisors (96809688080906).
121012110101110 is a wasteful number, since it uses less digits than its factorization.
121012110101110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12101211010118.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 121012110101110 its reverse (11101011210121), we get a palindrome (132113121311231).
The spelling of 121012110101110 in words is "one hundred twenty-one trillion, twelve billion, one hundred ten million, one hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •