Base | Representation |
---|---|
bin | 101101110001010110010100… |
… | …010110011111111001010011 |
3 | 222101202102000212102221021211 |
4 | 231301112110112133321103 |
5 | 202341123140121401003 |
6 | 1552045244154000551 |
7 | 60254453465133136 |
oct | 5561262426377123 |
9 | 871672025387254 |
10 | 201303311122003 |
11 | 59161289186502 |
12 | 1a6b1b1b716157 |
13 | 8842a89360abc |
14 | 379d1bcc4221d |
15 | 1841563a1296d |
hex | b7159459fe53 |
201303311122003 has 8 divisors (see below), whose sum is σ = 206353709730000. Its totient is φ = 196314880595328.
The previous prime is 201303311121947. The next prime is 201303311122019. The reversal of 201303311122003 is 300221113303102.
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 201303311122003 - 217 = 201303310990931 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201303311122063) 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, 15492013753 + ... + 15492026746.
It is an arithmetic number, because the mean of its divisors is an integer number (25794213716250).
Almost surely, 2201303311122003 is an apocalyptic number.
201303311122003 is a deficient number, since it is larger than the sum of its proper divisors (5050398607997).
201303311122003 is an equidigital number, since it uses as much as digits as its factorization.
201303311122003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30984040661.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 201303311122003 its reverse (300221113303102), we get a palindrome (501524424425105).
The spelling of 201303311122003 in words is "two hundred one trillion, three hundred three billion, three hundred eleven million, one hundred twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •