Base | Representation |
---|---|
bin | 1011101100110010101… |
… | …0100010101111001011 |
3 | 201012211012002201110100 |
4 | 2323030222202233023 |
5 | 11243123030400021 |
6 | 232201130420443 |
7 | 20344010336634 |
oct | 2731452425713 |
9 | 635735081410 |
10 | 201002200011 |
11 | 78276557978 |
12 | 32b57291723 |
13 | 15c53b49832 |
14 | 9a2b24288b |
15 | 536643c626 |
hex | 2eccaa2bcb |
201002200011 has 12 divisors (see below), whose sum is σ = 291638471488. Its totient is φ = 133400561904.
The previous prime is 201002199977. The next prime is 201002200019. The reversal of 201002200011 is 110002200102.
It is not a de Polignac number, because 201002200011 - 27 = 201002199883 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201002199966 and 201002200002.
It is not an unprimeable number, because it can be changed into a prime (201002200019) 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, 50073280 + ... + 50077293.
Almost surely, 2201002200011 is an apocalyptic number.
201002200011 is a deficient number, since it is larger than the sum of its proper divisors (90636271477).
201002200011 is a wasteful number, since it uses less digits than its factorization.
201002200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100150802 (or 100150799 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 201002200011 its reverse (110002200102), we get a palindrome (311004400113).
Subtracting from 201002200011 its reverse (110002200102), we obtain a palindrome (90999999909).
The spelling of 201002200011 in words is "two hundred one billion, two million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •