Base | Representation |
---|---|
bin | 101101101111110111001001… |
… | …010010110011011110111011 |
3 | 222101101122021000001201102022 |
4 | 231233313021102303132323 |
5 | 202332434343223143003 |
6 | 1551530304002225055 |
7 | 60244205215056566 |
oct | 5557671122633673 |
9 | 871348230051368 |
10 | 201201120131003 |
11 | 59121a09014443 |
12 | 1a69616005518b |
13 | 88362519554a5 |
14 | 3798286c0b4dd |
15 | 183da8228a738 |
hex | b6fdc94b37bb |
201201120131003 has 8 divisors (see below), whose sum is σ = 201574948913280. Its totient is φ = 200827298445120.
The previous prime is 201201120130909. The next prime is 201201120131021. The reversal of 201201120131003 is 300131021102102.
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 201201120131003 - 236 = 201132400654267 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201201120133003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56776943 + ... + 60216471.
It is an arithmetic number, because the mean of its divisors is an integer number (25196868614160).
Almost surely, 2201201120131003 is an apocalyptic number.
201201120131003 is a deficient number, since it is larger than the sum of its proper divisors (373828782277).
201201120131003 is a wasteful number, since it uses less digits than its factorization.
201201120131003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3548197.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 201201120131003 its reverse (300131021102102), we get a palindrome (501332141233105).
The spelling of 201201120131003 in words is "two hundred one trillion, two hundred one billion, one hundred twenty million, one hundred thirty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.217 sec. • engine limits •