Base | Representation |
---|---|
bin | 111000011001000100… |
… | …0010001000111001011 |
3 | 102120120200020002220121 |
4 | 1300302020101013023 |
5 | 3441003112043311 |
6 | 131344351404111 |
7 | 11514654653662 |
oct | 1606210210713 |
9 | 376520202817 |
10 | 121100112331 |
11 | 473a3946870 |
12 | 1b578223637 |
13 | b55c0a7203 |
14 | 5c0b4b3dd9 |
15 | 323b85eb71 |
hex | 1c322111cb |
121100112331 has 4 divisors (see below), whose sum is σ = 132109213464. Its totient is φ = 110091011200.
The previous prime is 121100112319. The next prime is 121100112373. The reversal of 121100112331 is 133211001121.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 121100112331 - 215 = 121100079563 is a prime.
It is a super-2 number, since 2×1211001123312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121100112031) 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, 5504550550 + ... + 5504550571.
It is an arithmetic number, because the mean of its divisors is an integer number (33027303366).
Almost surely, 2121100112331 is an apocalyptic number.
121100112331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
121100112331 is a deficient number, since it is larger than the sum of its proper divisors (11009101133).
121100112331 is a wasteful number, since it uses less digits than its factorization.
121100112331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11009101132.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 121100112331 its reverse (133211001121), we get a palindrome (254311113452).
The spelling of 121100112331 in words is "one hundred twenty-one billion, one hundred million, one hundred twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •