Base | Representation |
---|---|
bin | 101101101100111101000011… |
… | …010001011100001111111011 |
3 | 222100200112111102010101220102 |
4 | 231230331003101130033323 |
5 | 202321201132100144011 |
6 | 1551254420210350015 |
7 | 60223602445434626 |
oct | 5554750321341773 |
9 | 870615442111812 |
10 | 201001303131131 |
11 | 590551a0584a18 |
12 | 1a66349588b30b |
13 | 882045951a919 |
14 | 378c72d164dbd |
15 | 1838789e1373b |
hex | b6cf4345c3fb |
201001303131131 has 4 divisors (see below), whose sum is σ = 201020324746992. Its totient is φ = 200982281515272.
The previous prime is 201001303131127. The next prime is 201001303131169. The reversal of 201001303131131 is 131131303100102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201001303131131 - 22 = 201001303131127 is a prime.
It is a super-2 number, since 2×2010013031311312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201001303131331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9510792080 + ... + 9510813213.
It is an arithmetic number, because the mean of its divisors is an integer number (50255081186748).
Almost surely, 2201001303131131 is an apocalyptic number.
201001303131131 is a deficient number, since it is larger than the sum of its proper divisors (19021615861).
201001303131131 is a wasteful number, since it uses less digits than its factorization.
201001303131131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19021615860.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 201001303131131 its reverse (131131303100102), we get a palindrome (332132606231233).
The spelling of 201001303131131 in words is "two hundred one trillion, one billion, three hundred three million, one hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •