Base | Representation |
---|---|
bin | 1011101100110111111… |
… | …1000000110010111111 |
3 | 201012212201202201020121 |
4 | 2323031333000302333 |
5 | 11243144212440411 |
6 | 232203241155411 |
7 | 20344366503265 |
oct | 2731577006277 |
9 | 635781681217 |
10 | 201024343231 |
11 | 78288001458 |
12 | 32b6278bb67 |
13 | 15c5860062a |
14 | 9a30168435 |
15 | 5368363571 |
hex | 2ecdfc0cbf |
201024343231 has 2 divisors, whose sum is σ = 201024343232. Its totient is φ = 201024343230.
The previous prime is 201024343213. The next prime is 201024343243. The reversal of 201024343231 is 132343420102.
Together with previous prime (201024343213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201024343231 is a prime.
It is a super-2 number, since 2×2010243432312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201024343196 and 201024343205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201024343211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100512171615 + 100512171616.
It is an arithmetic number, because the mean of its divisors is an integer number (100512171616).
Almost surely, 2201024343231 is an apocalyptic number.
201024343231 is a deficient number, since it is larger than the sum of its proper divisors (1).
201024343231 is an equidigital number, since it uses as much as digits as its factorization.
201024343231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 201024343231 its reverse (132343420102), we get a palindrome (333367763333).
The spelling of 201024343231 in words is "two hundred one billion, twenty-four million, three hundred forty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •