Base | Representation |
---|---|
bin | 11101000111000011110… |
… | …00001010101100010011 |
3 | 10112121202012011201010111 |
4 | 32203201320022230103 |
5 | 112341423313311011 |
6 | 2043255020542151 |
7 | 132156301543621 |
oct | 16434170125423 |
9 | 3477665151114 |
10 | 1000222010131 |
11 | 356212281443 |
12 | 141a243b1957 |
13 | 7342228b196 |
14 | 365a7b18511 |
15 | 1b040ebc121 |
hex | e8e1e0ab13 |
1000222010131 has 2 divisors, whose sum is σ = 1000222010132. Its totient is φ = 1000222010130.
The previous prime is 1000222010111. The next prime is 1000222010239. The reversal of 1000222010131 is 1310102220001.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1000222010131 is a prime.
It is a super-2 number, since 2×10002220101312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1000222010111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500111005065 + 500111005066.
It is an arithmetic number, because the mean of its divisors is an integer number (500111005066).
Almost surely, 21000222010131 is an apocalyptic number.
1000222010131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000222010131 is an equidigital number, since it uses as much as digits as its factorization.
1000222010131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 1000222010131 its reverse (1310102220001), we get a palindrome (2310324230132).
The spelling of 1000222010131 in words is "one trillion, two hundred twenty-two million, ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •