Base | Representation |
---|---|
bin | 1011101110011000111… |
… | …1011110101110110011 |
3 | 201020221002112221021021 |
4 | 2323212033132232303 |
5 | 11300012404011311 |
6 | 232311500040311 |
7 | 20360440625113 |
oct | 2734617365663 |
9 | 636832487237 |
10 | 201431313331 |
11 | 784767a8086 |
12 | 33056b33097 |
13 | 15cc1a12641 |
14 | 9a6c225043 |
15 | 538de52171 |
hex | 2ee63debb3 |
201431313331 has 4 divisors (see below), whose sum is σ = 207929097664. Its totient is φ = 194933529000.
The previous prime is 201431313323. The next prime is 201431313437. The reversal of 201431313331 is 133313134102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201431313331 - 23 = 201431313323 is a prime.
It is a super-2 number, since 2×2014313133312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201431313296 and 201431313305.
It is not an unprimeable number, because it can be changed into a prime (201431313131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3248892120 + ... + 3248892181.
It is an arithmetic number, because the mean of its divisors is an integer number (51982274416).
Almost surely, 2201431313331 is an apocalyptic number.
201431313331 is a deficient number, since it is larger than the sum of its proper divisors (6497784333).
201431313331 is an equidigital number, since it uses as much as digits as its factorization.
201431313331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6497784332.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 201431313331 its reverse (133313134102), we get a palindrome (334744447433).
The spelling of 201431313331 in words is "two hundred one billion, four hundred thirty-one million, three hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •