Base | Representation |
---|---|
bin | 1011101101001110101… |
… | …1111101001011111001 |
3 | 201020010101210010202100 |
4 | 2323103223331023321 |
5 | 11243343210323001 |
6 | 232220535454013 |
7 | 20346640613130 |
oct | 2732353751371 |
9 | 636111703670 |
10 | 201120011001 |
11 | 78327004028 |
12 | 32b8a827309 |
13 | 15c72388290 |
14 | 9a3cb4c917 |
15 | 537195e586 |
hex | 2ed3afd2f9 |
201120011001 has 96 divisors (see below), whose sum is σ = 367520444928. Its totient is φ = 103130910720.
The previous prime is 201120010979. The next prime is 201120011047. The reversal of 201120011001 is 100110021102.
It is a happy number.
It is not a de Polignac number, because 201120011001 - 27 = 201120010873 is a prime.
It is a super-2 number, since 2×2011200110012 (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 (201120011501) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 51422236 + ... + 51426146.
It is an arithmetic number, because the mean of its divisors is an integer number (3828337968).
Almost surely, 2201120011001 is an apocalyptic number.
201120011001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
201120011001 is a deficient number, since it is larger than the sum of its proper divisors (166400433927).
201120011001 is a wasteful number, since it uses less digits than its factorization.
201120011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5671 (or 5668 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 201120011001 its reverse (100110021102), we get a palindrome (301230032103).
The spelling of 201120011001 in words is "two hundred one billion, one hundred twenty million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •