Base | Representation |
---|---|
bin | 1011101101101001000… |
… | …0110010110101000011 |
3 | 201020102002100222121202 |
4 | 2323122100302311003 |
5 | 11244104431044303 |
6 | 232235520211415 |
7 | 20352450410306 |
oct | 2733220626503 |
9 | 636362328552 |
10 | 201230331203 |
11 | 78383304250 |
12 | 32bbb769b6b |
13 | 15c8c1a32c5 |
14 | 9a4d668b3d |
15 | 537b4a1c88 |
hex | 2eda432d43 |
201230331203 has 8 divisors (see below), whose sum is σ = 220299704256. Its totient is φ = 182290242600.
The previous prime is 201230331199. The next prime is 201230331221. The reversal of 201230331203 is 302133032102.
201230331203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 201230331203 - 22 = 201230331199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201230331233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32317853 + ... + 32324078.
It is an arithmetic number, because the mean of its divisors is an integer number (27537463032).
Almost surely, 2201230331203 is an apocalyptic number.
201230331203 is a deficient number, since it is larger than the sum of its proper divisors (19069373053).
201230331203 is a wasteful number, since it uses less digits than its factorization.
201230331203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64642225.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 201230331203 its reverse (302133032102), we get a palindrome (503363363305).
The spelling of 201230331203 in words is "two hundred one billion, two hundred thirty million, three hundred thirty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •