Base | Representation |
---|---|
bin | 1011101100110100111… |
… | …1111101111111111001 |
3 | 201012211212120011121100 |
4 | 2323031033331333321 |
5 | 11243133033323001 |
6 | 232202121002013 |
7 | 20344156621254 |
oct | 2731517757771 |
9 | 635755504540 |
10 | 201012011001 |
11 | 7828104902a |
12 | 32b5a623309 |
13 | 15c55ba3359 |
14 | 9a2c67809b |
15 | 5367229586 |
hex | 2ecd3fdff9 |
201012011001 has 12 divisors (see below), whose sum is σ = 290570829120. Its totient is φ = 133906401240.
The previous prime is 201012010999. The next prime is 201012011003. The reversal of 201012011001 is 100110210102.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (201012010999) and next prime (201012011003).
It is not a de Polignac number, because 201012011001 - 21 = 201012010999 is a prime.
It is a super-2 number, since 2×2010120110012 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (201012011003) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8454645 + ... + 8478386.
It is an arithmetic number, because the mean of its divisors is an integer number (24214235760).
Almost surely, 2201012011001 is an apocalyptic number.
It is an amenable number.
201012011001 is a deficient number, since it is larger than the sum of its proper divisors (89558818119).
201012011001 is a wasteful number, since it uses less digits than its factorization.
201012011001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16934356 (or 16934353 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 201012011001 its reverse (100110210102), we get a palindrome (301122221103).
The spelling of 201012011001 in words is "two hundred one billion, twelve million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •