Base | Representation |
---|---|
bin | 1011101100111100011… |
… | …1101101110100101111 |
3 | 201012221001122000000002 |
4 | 2323033013231310233 |
5 | 11243214102331111 |
6 | 232205201454515 |
7 | 20345020502303 |
oct | 2731707556457 |
9 | 635831560002 |
10 | 201043402031 |
11 | 7829783962a |
12 | 32b6904143b |
13 | 15c5c544524 |
14 | 9a328c9d03 |
15 | 5369d7a63b |
hex | 2ecf1edd2f |
201043402031 has 2 divisors, whose sum is σ = 201043402032. Its totient is φ = 201043402030.
The previous prime is 201043402009. The next prime is 201043402037. The reversal of 201043402031 is 130204340102.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201043402031 is a prime.
It is a super-2 number, since 2×2010434020312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201043401994 and 201043402012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201043402037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100521701015 + 100521701016.
It is an arithmetic number, because the mean of its divisors is an integer number (100521701016).
Almost surely, 2201043402031 is an apocalyptic number.
201043402031 is a deficient number, since it is larger than the sum of its proper divisors (1).
201043402031 is an equidigital number, since it uses as much as digits as its factorization.
201043402031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 201043402031 its reverse (130204340102), we get a palindrome (331247742133).
The spelling of 201043402031 in words is "two hundred one billion, forty-three million, four hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •