Base | Representation |
---|---|
bin | 11011100001000101101100… |
… | …111111100110011010000110 |
3 | 120212111111200002011212201222 |
4 | 123201011230333212122012 |
5 | 111330302224230023420 |
6 | 1105220200323320342 |
7 | 34330326140004104 |
oct | 3341055477463206 |
9 | 525444602155658 |
10 | 121021122111110 |
11 | 35619851465881 |
12 | 116a6854b200b2 |
13 | 526b3206c30c0 |
14 | 21c564c814c74 |
15 | ded0853da225 |
hex | 6e116cfe6686 |
121021122111110 has 32 divisors (see below), whose sum is σ = 246941884798560. Its totient is φ = 42332894535168.
The previous prime is 121021122111089. The next prime is 121021122111139. The reversal of 121021122111110 is 11111221120121.
It is a super-2 number, since 2×1210211221111102 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24498200387 + ... + 24498205326.
It is an arithmetic number, because the mean of its divisors is an integer number (7716933899955).
Almost surely, 2121021122111110 is an apocalyptic number.
121021122111110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121021122111110 is an abundant number, since it is smaller than the sum of its proper divisors (125920762687450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121021122111110 is a wasteful number, since it uses less digits than its factorization.
121021122111110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48996405752.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 121021122111110 its reverse (11111221120121), we get a palindrome (132132343231231).
The spelling of 121021122111110 in words is "one hundred twenty-one trillion, twenty-one billion, one hundred twenty-two million, one hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •