Base | Representation |
---|---|
bin | 101101110001110001001000… |
… | …011011011110111001100111 |
3 | 222101212011100100210202012121 |
4 | 231301301020123132321213 |
5 | 202342111121121200203 |
6 | 1552110405121130411 |
7 | 60256523114516563 |
oct | 5561611033367147 |
9 | 871764310722177 |
10 | 201332102131303 |
11 | 59172512a32970 |
12 | 1a6b7615789a07 |
13 | 88456c7104390 |
14 | 37a075089a6a3 |
15 | 184219b4270bd |
hex | b71c486dee67 |
201332102131303 has 8 divisors (see below), whose sum is σ = 236530022084496. Its totient is φ = 168950015774400.
The previous prime is 201332102131253. The next prime is 201332102131361. The reversal of 201332102131303 is 303131201233102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201332102131303 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201332102131903) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 703958398918 + ... + 703958399203.
It is an arithmetic number, because the mean of its divisors is an integer number (29566252760562).
Almost surely, 2201332102131303 is an apocalyptic number.
201332102131303 is a deficient number, since it is larger than the sum of its proper divisors (35197919953193).
201332102131303 is a wasteful number, since it uses less digits than its factorization.
201332102131303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1407916798145.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 201332102131303 its reverse (303131201233102), we get a palindrome (504463303364405).
The spelling of 201332102131303 in words is "two hundred one trillion, three hundred thirty-two billion, one hundred two million, one hundred thirty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •