Base | Representation |
---|---|
bin | 11011100010011010010101… |
… | …110011000110000100101011 |
3 | 120212211012020120212101020112 |
4 | 123202122111303012010223 |
5 | 111333244334224341021 |
6 | 1105330030221444535 |
7 | 34340024200632002 |
oct | 3342322563060453 |
9 | 525735216771215 |
10 | 121112001012011 |
11 | 35654347208149 |
12 | 1170039811074b |
13 | 5276a74632289 |
14 | 21c9bd0339c39 |
15 | e006039c6d5b |
hex | 6e2695cc612b |
121112001012011 has 8 divisors (see below), whose sum is σ = 121805295912720. Its totient is φ = 120418891573248.
The previous prime is 121112001011977. The next prime is 121112001012029. The reversal of 121112001012011 is 110210100211121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121112001012011 - 218 = 121112000749867 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121112001012031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45055586 + ... + 47667911.
It is an arithmetic number, because the mean of its divisors is an integer number (15225661989090).
Almost surely, 2121112001012011 is an apocalyptic number.
121112001012011 is a deficient number, since it is larger than the sum of its proper divisors (693294900709).
121112001012011 is an equidigital number, since it uses as much as digits as its factorization.
121112001012011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92730973.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 121112001012011 its reverse (110210100211121), we get a palindrome (231322101223132).
The spelling of 121112001012011 in words is "one hundred twenty-one trillion, one hundred twelve billion, one million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •