Base | Representation |
---|---|
bin | 1011101101100010100… |
… | …1101110111000110111 |
3 | 201020100012112101022011 |
4 | 2323120221232320313 |
5 | 11244031022023411 |
6 | 232233113145051 |
7 | 20352001644523 |
oct | 2733051567067 |
9 | 636305471264 |
10 | 201203314231 |
11 | 7836a030a77 |
12 | 32bb26bb187 |
13 | 15c8670402a |
14 | 9a49c34d83 |
15 | 5378e16c21 |
hex | 2ed8a6ee37 |
201203314231 has 4 divisors (see below), whose sum is σ = 201681232264. Its totient is φ = 200725396200.
The previous prime is 201203314211. The next prime is 201203314253. The reversal of 201203314231 is 132413302102.
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 201203314231 - 225 = 201169759799 is a prime.
It is a super-2 number, since 2×2012033142312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201203314201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 238958385 + ... + 238959226.
It is an arithmetic number, because the mean of its divisors is an integer number (50420308066).
Almost surely, 2201203314231 is an apocalyptic number.
201203314231 is a deficient number, since it is larger than the sum of its proper divisors (477918033).
201203314231 is an equidigital number, since it uses as much as digits as its factorization.
201203314231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 477918032.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 201203314231 its reverse (132413302102), we get a palindrome (333616616333).
The spelling of 201203314231 in words is "two hundred one billion, two hundred three million, three hundred fourteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •