Base | Representation |
---|---|
bin | 1010000001100100100100… |
… | …0100100011001011111001 |
3 | 1110000200222221022012222211 |
4 | 2200121021010203023321 |
5 | 2421041241133323001 |
6 | 35235253252415121 |
7 | 2215215132160600 |
oct | 240311104431371 |
9 | 43020887265884 |
10 | 11022112011001 |
11 | 356a4a6980073 |
12 | 12a01ab0174a1 |
13 | 61c4c4533830 |
14 | 2a168a152a37 |
15 | 141a9ca61351 |
hex | a06491232f9 |
11022112011001 has 24 divisors (see below), whose sum is σ = 13808285079624. Its totient is φ = 8720561687040.
The previous prime is 11022112010963. The next prime is 11022112011019. The reversal of 11022112011001 is 10011021122011.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 368905605376 + 10653206405625 = 607376^2 + 3263925^2 .
It is not a de Polignac number, because 11022112011001 - 215 = 11022111978233 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (11022112011601) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 26343231 + ... + 26758363.
It is an arithmetic number, because the mean of its divisors is an integer number (575345211651).
Almost surely, 211022112011001 is an apocalyptic number.
It is an amenable number.
11022112011001 is a deficient number, since it is larger than the sum of its proper divisors (2786173068623).
11022112011001 is a wasteful number, since it uses less digits than its factorization.
11022112011001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 456841 (or 456834 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11022112011001 its reverse (10011021122011), we get a palindrome (21033133133012).
The spelling of 11022112011001 in words is "eleven trillion, twenty-two billion, one hundred twelve million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •