Base | Representation |
---|---|
bin | 101101101101010000011011… |
… | …100100111110111111101111 |
3 | 222100202112012121200120102122 |
4 | 231231100123210332333233 |
5 | 202322021241133031111 |
6 | 1551312141112543155 |
7 | 60225240222063005 |
oct | 5555203344767757 |
9 | 870675177616378 |
10 | 201022112002031 |
11 | 59062aa9653691 |
12 | 1a6675226b1abb |
13 | 88223c4663098 |
14 | 378d744a44a75 |
15 | 18390a6ba9cdb |
hex | b6d41b93efef |
201022112002031 has 2 divisors, whose sum is σ = 201022112002032. Its totient is φ = 201022112002030.
The previous prime is 201022112001973. The next prime is 201022112002169. The reversal of 201022112002031 is 130200211220102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201022112002031 - 238 = 200747234095087 is a prime.
It is a super-2 number, since 2×2010221120020312 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201022112002331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100511056001015 + 100511056001016.
It is an arithmetic number, because the mean of its divisors is an integer number (100511056001016).
Almost surely, 2201022112002031 is an apocalyptic number.
201022112002031 is a deficient number, since it is larger than the sum of its proper divisors (1).
201022112002031 is an equidigital number, since it uses as much as digits as its factorization.
201022112002031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 201022112002031 its reverse (130200211220102), we get a palindrome (331222323222133).
The spelling of 201022112002031 in words is "two hundred one trillion, twenty-two billion, one hundred twelve million, two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •