Base | Representation |
---|---|
bin | 11011100001000100101100… |
… | …000001100101001000000110 |
3 | 120212111101212010011010211121 |
4 | 123201010230001211020012 |
5 | 111330243011210023420 |
6 | 1105215500225024154 |
7 | 34330260133110406 |
oct | 3341045401451006 |
9 | 525441763133747 |
10 | 121020032111110 |
11 | 35619342160730 |
12 | 116a65aba8505a |
13 | 526b1a8933ca2 |
14 | 21c5587b5a806 |
15 | ded01e87c2aa |
hex | 6e112c065206 |
121020032111110 has 32 divisors (see below), whose sum is σ = 247971480820992. Its totient is φ = 42093924211680.
The previous prime is 121020032111081. The next prime is 121020032111141. The reversal of 121020032111110 is 11111230020121.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23916999864 + ... + 23917004923.
It is an arithmetic number, because the mean of its divisors is an integer number (7749108775656).
Almost surely, 2121020032111110 is an apocalyptic number.
121020032111110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121020032111110 is an abundant number, since it is smaller than the sum of its proper divisors (126951448709882).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121020032111110 is a wasteful number, since it uses less digits than its factorization.
121020032111110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47834004828.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 121020032111110 its reverse (11111230020121), we get a palindrome (132131262131231).
The spelling of 121020032111110 in words is "one hundred twenty-one trillion, twenty billion, thirty-two million, one hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •