Base | Representation |
---|---|
bin | 1011101100110010011… |
… | …0100000000010110101 |
3 | 201012211010002212221200 |
4 | 2323030212200002311 |
5 | 11243122242443110 |
6 | 232201052003113 |
7 | 20343665334462 |
oct | 2731446400265 |
9 | 635733085850 |
10 | 201001140405 |
11 | 782759a386a |
12 | 32b56a60499 |
13 | 15c53868450 |
14 | 9a2b048669 |
15 | 53662cd6c0 |
hex | 2ecc9a00b5 |
201001140405 has 48 divisors (see below), whose sum is σ = 387305458176. Its totient is φ = 95762321280.
The previous prime is 201001140259. The next prime is 201001140409. The reversal of 201001140405 is 504041100102.
201001140405 is a `hidden beast` number, since 20 + 100 + 1 + 140 + 405 = 666.
It is not a de Polignac number, because 201001140405 - 212 = 201001136309 is a prime.
It is a super-2 number, since 2×2010011404052 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201001140409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5523667 + ... + 5559936.
It is an arithmetic number, because the mean of its divisors is an integer number (8068863712).
Almost surely, 2201001140405 is an apocalyptic number.
It is an amenable number.
201001140405 is a deficient number, since it is larger than the sum of its proper divisors (186304317771).
201001140405 is a wasteful number, since it uses less digits than its factorization.
201001140405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11083658 (or 11083655 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
Adding to 201001140405 its reverse (504041100102), we get a palindrome (705042240507).
The spelling of 201001140405 in words is "two hundred one billion, one million, one hundred forty thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •