Base | Representation |
---|---|
bin | 1010000000011001101001… |
… | …1010111100100101001001 |
3 | 1102221210002102202211022000 |
4 | 2200012122122330211021 |
5 | 2420224100003001301 |
6 | 35222125553221213 |
7 | 2213603602665522 |
oct | 240063232744511 |
9 | 42853072684260 |
10 | 11002002000201 |
11 | 3561a17342333 |
12 | 1298318261809 |
13 | 61a63b11b964 |
14 | 2a06dd3d1849 |
15 | 1412c2314786 |
hex | a019a6bc949 |
11002002000201 has 32 divisors (see below), whose sum is σ = 16481886019200. Its totient is φ = 7252621286400.
The previous prime is 11002002000179. The next prime is 11002002000257. The reversal of 11002002000201 is 10200020020011.
It is not a de Polignac number, because 11002002000201 - 227 = 11001867782473 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11002002000271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1096426 + ... + 4817276.
It is an arithmetic number, because the mean of its divisors is an integer number (515058938100).
Almost surely, 211002002000201 is an apocalyptic number.
It is an amenable number.
11002002000201 is a deficient number, since it is larger than the sum of its proper divisors (5479884018999).
11002002000201 is a wasteful number, since it uses less digits than its factorization.
11002002000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3722086 (or 3722080 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 11002002000201 its reverse (10200020020011), we get a palindrome (21202022020212).
The spelling of 11002002000201 in words is "eleven trillion, two billion, two million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •