Base | Representation |
---|---|
bin | 1110011101100… |
… | …11111100101111 |
3 | 22110021212021222 |
4 | 13032303330233 |
5 | 222024321221 |
6 | 20012213555 |
7 | 3002142164 |
oct | 716637457 |
9 | 273255258 |
10 | 121323311 |
11 | 62535aaa |
12 | 3476a2bb |
13 | 1c19b355 |
14 | 1218206b |
15 | a9b79ab |
hex | 73b3f2f |
121323311 has 2 divisors, whose sum is σ = 121323312. Its totient is φ = 121323310.
The previous prime is 121323283. The next prime is 121323313. The reversal of 121323311 is 113323121.
It is a strong prime.
It is an emirp because it is prime and its reverse (113323121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121323311 - 26 = 121323247 is a prime.
Together with 121323313, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121323311.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121323313) 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 as a sum of consecutive naturals, namely, 60661655 + 60661656.
It is an arithmetic number, because the mean of its divisors is an integer number (60661656).
Almost surely, 2121323311 is an apocalyptic number.
121323311 is a deficient number, since it is larger than the sum of its proper divisors (1).
121323311 is an equidigital number, since it uses as much as digits as its factorization.
121323311 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 108, while the sum is 17.
The square root of 121323311 is about 11014.6861507716. The cubic root of 121323311 is about 495.0488827010.
Adding to 121323311 its reverse (113323121), we get a palindrome (234646432).
The spelling of 121323311 in words is "one hundred twenty-one million, three hundred twenty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •