Base | Representation |
---|---|
bin | 1010001100101100110011… |
… | …1100110000100011001001 |
3 | 1110200222111101002222122112 |
4 | 2203023030330300203021 |
5 | 2432204321044401441 |
6 | 35503153105432105 |
7 | 2235064050620042 |
oct | 243131474604311 |
9 | 43628441088575 |
10 | 11213303122121 |
11 | 3633598311711 |
12 | 131126863b635 |
13 | 634543866b09 |
14 | 2aaa263698c9 |
15 | 146a3c9a94eb |
hex | a32ccf308c9 |
11213303122121 has 2 divisors, whose sum is σ = 11213303122122. Its totient is φ = 11213303122120.
The previous prime is 11213303122069. The next prime is 11213303122123. The reversal of 11213303122121 is 12122130331211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11209532548096 + 3770574025 = 3348064^2 + 61405^2 .
It is a cyclic number.
It is not a de Polignac number, because 11213303122121 - 26 = 11213303122057 is a prime.
Together with 11213303122123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (11213303122123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5606651561060 + 5606651561061.
It is an arithmetic number, because the mean of its divisors is an integer number (5606651561061).
Almost surely, 211213303122121 is an apocalyptic number.
It is an amenable number.
11213303122121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11213303122121 is an equidigital number, since it uses as much as digits as its factorization.
11213303122121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 11213303122121 its reverse (12122130331211), we get a palindrome (23335433453332).
The spelling of 11213303122121 in words is "eleven trillion, two hundred thirteen billion, three hundred three million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •