Base | Representation |
---|---|
bin | 100000001011010111101… |
… | …101111011001001011011 |
3 | 21211101120120202000222222 |
4 | 200023113231323021123 |
5 | 242212100434032311 |
6 | 4411454234534255 |
7 | 315520253454563 |
oct | 40132755731133 |
9 | 7741516660888 |
10 | 2211232330331 |
11 | 782862005012 |
12 | 2b867529738b |
13 | 130697974a4b |
14 | 7904a63bda3 |
15 | 3c7bc5d4adb |
hex | 202d7b7b25b |
2211232330331 has 2 divisors, whose sum is σ = 2211232330332. Its totient is φ = 2211232330330.
The previous prime is 2211232330303. The next prime is 2211232330343. The reversal of 2211232330331 is 1330332321122.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2211232330331 - 210 = 2211232329307 is a prime.
It is a super-2 number, since 2×22112323303312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2211232330331.
It is not a weakly prime, because it can be changed into another prime (2211232339331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1105616165165 + 1105616165166.
It is an arithmetic number, because the mean of its divisors is an integer number (1105616165166).
Almost surely, 22211232330331 is an apocalyptic number.
2211232330331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2211232330331 is an equidigital number, since it uses as much as digits as its factorization.
2211232330331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 2211232330331 its reverse (1330332321122), we get a palindrome (3541564651453).
The spelling of 2211232330331 in words is "two trillion, two hundred eleven billion, two hundred thirty-two million, three hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •