Base | Representation |
---|---|
bin | 11110101111111000101… |
… | …011111110110001101111 |
3 | 21111000000200120122220001 |
4 | 132233320223332301233 |
5 | 234104411303034411 |
6 | 4254411021205131 |
7 | 305442066015445 |
oct | 36577053766157 |
9 | 7430020518801 |
10 | 2113001221231 |
11 | 74513411591a |
12 | 2a161ba007a7 |
13 | 124341782614 |
14 | 743ac4b6b95 |
15 | 39e6d80adc1 |
hex | 1ebf8afec6f |
2113001221231 has 2 divisors, whose sum is σ = 2113001221232. Its totient is φ = 2113001221230.
The previous prime is 2113001221193. The next prime is 2113001221241. The reversal of 2113001221231 is 1321221003112.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2113001221231 - 29 = 2113001220719 is a prime.
It is a super-2 number, since 2×21130012212312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2113001221199 and 2113001221208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2113001221241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1056500610615 + 1056500610616.
It is an arithmetic number, because the mean of its divisors is an integer number (1056500610616).
Almost surely, 22113001221231 is an apocalyptic number.
2113001221231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2113001221231 is an equidigital number, since it uses as much as digits as its factorization.
2113001221231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 2113001221231 its reverse (1321221003112), we get a palindrome (3434222224343).
The spelling of 2113001221231 in words is "two trillion, one hundred thirteen billion, one million, two hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •