Base | Representation |
---|---|
bin | 1010000000110111110100… |
… | …1101111111101001001001 |
3 | 1102222112222221100110102000 |
4 | 2200031331031333221021 |
5 | 2420342142103001301 |
6 | 35225545424301213 |
7 | 2214311406601053 |
oct | 240157515775111 |
9 | 42875887313360 |
10 | 11010102000201 |
11 | 35653a3601207 |
12 | 12999b8a71809 |
13 | 61b32c2a5575 |
14 | 2a0c6b08a8d3 |
15 | 1415e84b4786 |
hex | a037d37fa49 |
11010102000201 has 32 divisors (see below), whose sum is σ = 16355263242240. Its totient is φ = 7320284571600.
The previous prime is 11010102000167. The next prime is 11010102000211. The reversal of 11010102000201 is 10200020101011.
It is a happy number.
It is not a de Polignac number, because 11010102000201 - 211 = 11010101998153 is a prime.
It is a super-2 number, since 2×110101020002012 (a number of 27 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 (11010102000211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 23154006 + ... + 23624736.
It is an arithmetic number, because the mean of its divisors is an integer number (511101976320).
Almost surely, 211010102000201 is an apocalyptic number.
It is an amenable number.
11010102000201 is a deficient number, since it is larger than the sum of its proper divisors (5345161242039).
11010102000201 is a wasteful number, since it uses less digits than its factorization.
11010102000201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 473074 (or 473068 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11010102000201 its reverse (10200020101011), we get a palindrome (21210122101212).
The spelling of 11010102000201 in words is "eleven trillion, ten billion, one hundred two million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •