Base | Representation |
---|---|
bin | 101101101101000111001100… |
… | …111010001000101100100011 |
3 | 222100201120121222200002022002 |
4 | 231231013030322020230203 |
5 | 202321340442231242011 |
6 | 1551303421511434215 |
7 | 60224436521210162 |
oct | 5555071472105443 |
9 | 870646558602262 |
10 | 201012202212131 |
11 | 59059883853882 |
12 | 1a66561798596b |
13 | 88214a556c38b |
14 | 378d0848853d9 |
15 | 1838bc6bbac3b |
hex | b6d1cce88b23 |
201012202212131 has 2 divisors, whose sum is σ = 201012202212132. Its totient is φ = 201012202212130.
The previous prime is 201012202212083. The next prime is 201012202212149. The reversal of 201012202212131 is 131212202210102.
201012202212131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201012202212131 - 230 = 201011128470307 is a prime.
It is a super-2 number, since 2×2010122022121312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201012202212191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100506101106065 + 100506101106066.
It is an arithmetic number, because the mean of its divisors is an integer number (100506101106066).
Almost surely, 2201012202212131 is an apocalyptic number.
201012202212131 is a deficient number, since it is larger than the sum of its proper divisors (1).
201012202212131 is an equidigital number, since it uses as much as digits as its factorization.
201012202212131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 201012202212131 its reverse (131212202210102), we get a palindrome (332224404422233).
The spelling of 201012202212131 in words is "two hundred one trillion, twelve billion, two hundred two million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •