Base | Representation |
---|---|
bin | 11011100010011001101100… |
… | …101111111010011111110111 |
3 | 120212211010110120221210212020 |
4 | 123202121230233322133313 |
5 | 111333241431422443221 |
6 | 1105325434020324223 |
7 | 34340001136034106 |
oct | 3342315457723767 |
9 | 525733416853766 |
10 | 121111312312311 |
11 | 35654023486942 |
12 | 11700225543673 |
13 | 5276994a4b569 |
14 | 21c9b66aa403d |
15 | e005b32d7ac6 |
hex | 6e266cbfa7f7 |
121111312312311 has 8 divisors (see below), whose sum is σ = 162174804470640. Its totient is φ = 80394347514432.
The previous prime is 121111312312303. The next prime is 121111312312321. The reversal of 121111312312311 is 113213213111121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121111312312311 - 23 = 121111312312303 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121111312312301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 86631839296 + ... + 86631840693.
It is an arithmetic number, because the mean of its divisors is an integer number (20271850558830).
Almost surely, 2121111312312311 is an apocalyptic number.
121111312312311 is a deficient number, since it is larger than the sum of its proper divisors (41063492158329).
121111312312311 is a wasteful number, since it uses less digits than its factorization.
121111312312311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173263680225.
The product of its digits is 216, while the sum is 24.
Adding to 121111312312311 its reverse (113213213111121), we get a palindrome (234324525423432).
The spelling of 121111312312311 in words is "one hundred twenty-one trillion, one hundred eleven billion, three hundred twelve million, three hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •