Base | Representation |
---|---|
bin | 111000011001000110… |
… | …0000101001111110111 |
3 | 102120120202002220121220 |
4 | 1300302030011033313 |
5 | 3441003341043221 |
6 | 131344425041423 |
7 | 11514666320244 |
oct | 1606214051767 |
9 | 376522086556 |
10 | 121101112311 |
11 | 473a446a0a3 |
12 | 1b578626273 |
13 | b55c36740a |
14 | 5c0b6945cb |
15 | 323b9ab0c6 |
hex | 1c323053f7 |
121101112311 has 8 divisors (see below), whose sum is σ = 162949509360. Its totient is φ = 79993395072.
The previous prime is 121101112303. The next prime is 121101112313. The reversal of 121101112311 is 113211101121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121101112311 - 23 = 121101112303 is a prime.
It is a super-4 number, since 4×1211011123114 (a number of 45 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121101112313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 185169570 + ... + 185170223.
It is an arithmetic number, because the mean of its divisors is an integer number (20368688670).
Almost surely, 2121101112311 is an apocalyptic number.
121101112311 is a deficient number, since it is larger than the sum of its proper divisors (41848397049).
121101112311 is a wasteful number, since it uses less digits than its factorization.
121101112311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 370339905.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 121101112311 its reverse (113211101121), we get a palindrome (234312213432).
The spelling of 121101112311 in words is "one hundred twenty-one billion, one hundred one million, one hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •