Base | Representation |
---|---|
bin | 1010000000010110000000… |
… | …0000111011001000100001 |
3 | 1102221200120010220201221000 |
4 | 2200011200000323020201 |
5 | 2420220043124200001 |
6 | 35221444430422213 |
7 | 2213540403660603 |
oct | 240054000731041 |
9 | 42850503821830 |
10 | 11001022100001 |
11 | 35615641a785a |
12 | 12980a4061969 |
13 | 61a5130cb45b |
14 | 2a06491d7173 |
15 | 1412662a3a86 |
hex | a016003b221 |
11001022100001 has 16 divisors (see below), whose sum is σ = 16605316379520. Its totient is φ = 7195637095920.
The previous prime is 11001022099999. The next prime is 11001022100039. The reversal of 11001022100001 is 10000122010011.
It is a happy number.
It is not a de Polignac number, because 11001022100001 - 21 = 11001022099999 is a prime.
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 (11001022104001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3843821805 + ... + 3843824666.
It is an arithmetic number, because the mean of its divisors is an integer number (1037832273720).
Almost surely, 211001022100001 is an apocalyptic number.
It is an amenable number.
11001022100001 is a deficient number, since it is larger than the sum of its proper divisors (5604294279519).
11001022100001 is an equidigital number, since it uses as much as digits as its factorization.
11001022100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7687646533 (or 7687646527 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11001022100001 its reverse (10000122010011), we get a palindrome (21001144110012).
The spelling of 11001022100001 in words is "eleven trillion, one billion, twenty-two million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.284 sec. • engine limits •