Base | Representation |
---|---|
bin | 100000010011110000001… |
… | …101001011101001000011 |
3 | 21212020210212022010102212 |
4 | 200103300031023221003 |
5 | 242334014134042011 |
6 | 4415543324532335 |
7 | 316256306033126 |
oct | 40236015135103 |
9 | 7766725263385 |
10 | 2220233112131 |
11 | 78666078a661 |
12 | 2ba3676b10ab |
13 | 1314a0639b38 |
14 | 79661bb83bd |
15 | 3cb478b808b |
hex | 204f034ba43 |
2220233112131 has 2 divisors, whose sum is σ = 2220233112132. Its totient is φ = 2220233112130.
The previous prime is 2220233112091. The next prime is 2220233112203. The reversal of 2220233112131 is 1312113320222.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2220233112131 - 218 = 2220232849987 is a prime.
It is a super-2 number, since 2×22202331121312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2220233112097 and 2220233112106.
It is not a weakly prime, because it can be changed into another prime (2220233115131) 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, 1110116556065 + 1110116556066.
It is an arithmetic number, because the mean of its divisors is an integer number (1110116556066).
Almost surely, 22220233112131 is an apocalyptic number.
2220233112131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2220233112131 is an equidigital number, since it uses as much as digits as its factorization.
2220233112131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 2220233112131 its reverse (1312113320222), we get a palindrome (3532346432353).
The spelling of 2220233112131 in words is "two trillion, two hundred twenty billion, two hundred thirty-three million, one hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •