Base | Representation |
---|---|
bin | 11101000110101011111… |
… | …01001100010111101011 |
3 | 10112121020020211012100202 |
4 | 32203111331030113223 |
5 | 112341021113014011 |
6 | 2043223114022415 |
7 | 132151322521166 |
oct | 16432575142753 |
9 | 3477206735322 |
10 | 1000022001131 |
11 | 35611a39274a |
12 | 141989417a0b |
13 | 733bc9cca6a |
14 | 36589332add |
15 | 1b02d66023b |
hex | e8d5f4c5eb |
1000022001131 has 2 divisors, whose sum is σ = 1000022001132. Its totient is φ = 1000022001130.
The previous prime is 1000022001113. The next prime is 1000022001193. The reversal of 1000022001131 is 1311002200001.
Together with previous prime (1000022001113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1000022001131 - 214 = 1000021984747 is a prime.
It is a super-2 number, since 2×10000220011312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1000022001331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500011000565 + 500011000566.
It is an arithmetic number, because the mean of its divisors is an integer number (500011000566).
Almost surely, 21000022001131 is an apocalyptic number.
1000022001131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000022001131 is an equidigital number, since it uses as much as digits as its factorization.
1000022001131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 1000022001131 its reverse (1311002200001), we get a palindrome (2311024201132).
The spelling of 1000022001131 in words is "one trillion, twenty-two million, one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •