Base | Representation |
---|---|
bin | 11011100101001010011110… |
… | …111001110010010011101111 |
3 | 120220111021102110210101222121 |
4 | 123211022132321302103233 |
5 | 111344344204333301111 |
6 | 1105552545414053411 |
7 | 34356501065351134 |
oct | 3345123671622357 |
9 | 526437373711877 |
10 | 121301132322031 |
11 | 35717580977732 |
12 | 11730b7b94a267 |
13 | 528b855cb093c |
14 | 21d5012b6c58b |
15 | e054c2b98871 |
hex | 6e529ee724ef |
121301132322031 has 2 divisors, whose sum is σ = 121301132322032. Its totient is φ = 121301132322030.
The previous prime is 121301132321981. The next prime is 121301132322037. The reversal of 121301132322031 is 130223231103121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121301132322031 - 27 = 121301132321903 is a prime.
It is a super-2 number, since 2×1213011323220312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121301132321987 and 121301132322005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121301132322037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60650566161015 + 60650566161016.
It is an arithmetic number, because the mean of its divisors is an integer number (60650566161016).
Almost surely, 2121301132322031 is an apocalyptic number.
121301132322031 is a deficient number, since it is larger than the sum of its proper divisors (1).
121301132322031 is an equidigital number, since it uses as much as digits as its factorization.
121301132322031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 121301132322031 its reverse (130223231103121), we get a palindrome (251524363425152).
The spelling of 121301132322031 in words is "one hundred twenty-one trillion, three hundred one billion, one hundred thirty-two million, three hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •