Base | Representation |
---|---|
bin | 1010000000010101111011… |
… | …0101000000110000100101 |
3 | 1102221200111202110201101200 |
4 | 2200011132311000300211 |
5 | 2420220023030400401 |
6 | 35221442440113113 |
7 | 2213540042556444 |
oct | 240053665006045 |
9 | 42850452421350 |
10 | 11001002200101 |
11 | 3561553a45761 |
12 | 1298099465799 |
13 | 61a50bc51774 |
14 | 2a06466d6d5b |
15 | 141264672686 |
hex | a015ed40c25 |
11001002200101 has 24 divisors (see below), whose sum is σ = 16036577700000. Its totient is φ = 7266509380512.
The previous prime is 11001002200093. The next prime is 11001002200121. The reversal of 11001002200101 is 10100220010011.
It is a happy number.
It is not a de Polignac number, because 11001002200101 - 23 = 11001002200093 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001002200121) 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 23 ways as a sum of consecutive naturals, for example, 39079150 + ... + 39359648.
It is an arithmetic number, because the mean of its divisors is an integer number (668190737500).
Almost surely, 211001002200101 is an apocalyptic number.
It is an amenable number.
11001002200101 is a deficient number, since it is larger than the sum of its proper divisors (5035575499899).
11001002200101 is a wasteful number, since it uses less digits than its factorization.
11001002200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 320593 (or 320590 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11001002200101 its reverse (10100220010011), we get a palindrome (21101222210112).
The spelling of 11001002200101 in words is "eleven trillion, one billion, two million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •