Base | Representation |
---|---|
bin | 11101010001000110010… |
… | …000001001000011010111 |
3 | 21010021022121112010210011 |
4 | 131101012100021003113 |
5 | 230422441133043111 |
6 | 4135535423541051 |
7 | 265206663146545 |
oct | 35210620110327 |
9 | 7107277463704 |
10 | 2011223331031 |
11 | 705a56157582 |
12 | 28595675a787 |
13 | 117871824655 |
14 | 6d4b5296d95 |
15 | 374b3484021 |
hex | 1d4464090d7 |
2011223331031 has 2 divisors, whose sum is σ = 2011223331032. Its totient is φ = 2011223331030.
The previous prime is 2011223331017. The next prime is 2011223331041. The reversal of 2011223331031 is 1301333221102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2011223331031 - 225 = 2011189776599 is a prime.
It is a super-2 number, since 2×20112233310312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2011223330993 and 2011223331011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2011223331001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005611665515 + 1005611665516.
It is an arithmetic number, because the mean of its divisors is an integer number (1005611665516).
Almost surely, 22011223331031 is an apocalyptic number.
2011223331031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011223331031 is an equidigital number, since it uses as much as digits as its factorization.
2011223331031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 2011223331031 its reverse (1301333221102), we get a palindrome (3312556552133).
The spelling of 2011223331031 in words is "two trillion, eleven billion, two hundred twenty-three million, three hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •