Base | Representation |
---|---|
bin | 11000000000100… |
… | …11001001100111 |
3 | 112000222102202121 |
4 | 30000103021213 |
5 | 403024430111 |
6 | 31552450411 |
7 | 4663625452 |
oct | 1400231147 |
9 | 460872677 |
10 | 201405031 |
11 | a3762643 |
12 | 57549a07 |
13 | 32959999 |
14 | 1ca6a499 |
15 | 12a35871 |
hex | c013267 |
201405031 has 2 divisors, whose sum is σ = 201405032. Its totient is φ = 201405030.
The previous prime is 201405013. The next prime is 201405091. The reversal of 201405031 is 130504102.
Together with previous prime (201405013) 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 201405031 - 29 = 201404519 is a prime.
It is a super-2 number, since 2×2014050312 = 81127973024221922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201404996 and 201405014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201405091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100702515 + 100702516.
It is an arithmetic number, because the mean of its divisors is an integer number (100702516).
Almost surely, 2201405031 is an apocalyptic number.
201405031 is a deficient number, since it is larger than the sum of its proper divisors (1).
201405031 is an equidigital number, since it uses as much as digits as its factorization.
201405031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 201405031 is about 14191.7240319843. The cubic root of 201405031 is about 586.1697984342.
Adding to 201405031 its reverse (130504102), we get a palindrome (331909133).
The spelling of 201405031 in words is "two hundred one million, four hundred five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •