Base | Representation |
---|---|
bin | 11011100101011111000100… |
… | …110000101111110010100111 |
3 | 120220120101111100122211120111 |
4 | 123211133010300233302213 |
5 | 111400230000013314421 |
6 | 1110011043400113451 |
7 | 34361213021304523 |
oct | 3345370460576247 |
9 | 526511440584514 |
10 | 121323242323111 |
11 | 357259974457a4 |
12 | 11735310465887 |
13 | 529096a86860a |
14 | 21d610d384d83 |
15 | e05d68ca4ee1 |
hex | 6e57c4c2fca7 |
121323242323111 has 2 divisors, whose sum is σ = 121323242323112. Its totient is φ = 121323242323110.
The previous prime is 121323242323109. The next prime is 121323242323123. The reversal of 121323242323111 is 111323242323121.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 121323242323111 - 21 = 121323242323109 is a prime.
It is a super-2 number, since 2×1213232423231112 (a number of 29 digits) contains 22 as substring.
Together with 121323242323109, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121323242323211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60661621161555 + 60661621161556.
It is an arithmetic number, because the mean of its divisors is an integer number (60661621161556).
Almost surely, 2121323242323111 is an apocalyptic number.
121323242323111 is a deficient number, since it is larger than the sum of its proper divisors (1).
121323242323111 is an equidigital number, since it uses as much as digits as its factorization.
121323242323111 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10368, while the sum is 31.
Adding to 121323242323111 its reverse (111323242323121), we get a palindrome (232646484646232).
The spelling of 121323242323111 in words is "one hundred twenty-one trillion, three hundred twenty-three billion, two hundred forty-two million, three hundred twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •