Base | Representation |
---|---|
bin | 1011101110010110010… |
… | …0110000000010011111 |
3 | 201020220022110211222022 |
4 | 2323211210300002133 |
5 | 11300002022041111 |
6 | 232310420010355 |
7 | 20360243463215 |
oct | 2734544600237 |
9 | 636808424868 |
10 | 201420112031 |
11 | 78470447406 |
12 | 330532309bb |
13 | 15cbc5c0058 |
14 | 9a6a94acb5 |
15 | 538ce8d2db |
hex | 2ee593009f |
201420112031 has 2 divisors, whose sum is σ = 201420112032. Its totient is φ = 201420112030.
The previous prime is 201420112027. The next prime is 201420112073. The reversal of 201420112031 is 130211024102.
201420112031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201420112031 - 22 = 201420112027 is a prime.
It is a super-2 number, since 2×2014201120312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201420111031) 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, 100710056015 + 100710056016.
It is an arithmetic number, because the mean of its divisors is an integer number (100710056016).
Almost surely, 2201420112031 is an apocalyptic number.
201420112031 is a deficient number, since it is larger than the sum of its proper divisors (1).
201420112031 is an equidigital number, since it uses as much as digits as its factorization.
201420112031 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 201420112031 its reverse (130211024102), we get a palindrome (331631136133).
The spelling of 201420112031 in words is "two hundred one billion, four hundred twenty million, one hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •