Base | Representation |
---|---|
bin | 1011101101010001010… |
… | …1111000110010001101 |
3 | 201020011011110120222012 |
4 | 2323110111320302031 |
5 | 11243404014044041 |
6 | 232222011231005 |
7 | 20350133213624 |
oct | 2732425706215 |
9 | 636134416865 |
10 | 201131003021 |
11 | 78332231543 |
12 | 32b92448465 |
13 | 15c74736530 |
14 | 9a403b06bb |
15 | 53728d13eb |
hex | 2ed4578c8d |
201131003021 has 8 divisors (see below), whose sum is σ = 221211185664. Its totient is φ = 181709187120.
The previous prime is 201131003011. The next prime is 201131003069. The reversal of 201131003021 is 120300131102.
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 201131003021 - 222 = 201126808717 is a prime.
It is a super-2 number, since 2×2011310030212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201131002987 and 201131003005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201131003011) 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, 164591045 + ... + 164592266.
It is an arithmetic number, because the mean of its divisors is an integer number (27651398208).
Almost surely, 2201131003021 is an apocalyptic number.
It is an amenable number.
201131003021 is a deficient number, since it is larger than the sum of its proper divisors (20080182643).
201131003021 is a wasteful number, since it uses less digits than its factorization.
201131003021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 329183371.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 201131003021 its reverse (120300131102), we get a palindrome (321431134123).
The spelling of 201131003021 in words is "two hundred one billion, one hundred thirty-one million, three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •