Base | Representation |
---|---|
bin | 1011101100111001100… |
… | …0011110111010101011 |
3 | 201012220012022221022212 |
4 | 2323032120132322223 |
5 | 11243202420121303 |
6 | 232204040235335 |
7 | 20344510322546 |
oct | 2731630367253 |
9 | 635805287285 |
10 | 201031020203 |
11 | 78290851a12 |
12 | 32b64a6bb4b |
13 | 15c59aca7c0 |
14 | 9a30dc585d |
15 | 5368c31ad8 |
hex | 2ece61eeab |
201031020203 has 8 divisors (see below), whose sum is σ = 221101220928. Its totient is φ = 181618858944.
The previous prime is 201031020199. The next prime is 201031020259. The reversal of 201031020203 is 302020130102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201031020203 - 22 = 201031020199 is a prime.
It is a super-2 number, since 2×2010310202032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201031020403) 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 7 ways as a sum of consecutive naturals, for example, 164509226 + ... + 164510447.
It is an arithmetic number, because the mean of its divisors is an integer number (27637652616).
Almost surely, 2201031020203 is an apocalyptic number.
201031020203 is a deficient number, since it is larger than the sum of its proper divisors (20070200725).
201031020203 is a wasteful number, since it uses less digits than its factorization.
201031020203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 329019733.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 201031020203 its reverse (302020130102), we get a palindrome (503051150305).
The spelling of 201031020203 in words is "two hundred one billion, thirty-one million, twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •