Base | Representation |
---|---|
bin | 1010000001100001001101… |
… | …1011010100100111111001 |
3 | 1110000121200012210111002111 |
4 | 2200120103123110213321 |
5 | 2421032420233323001 |
6 | 35235024102332321 |
7 | 2215153623252103 |
oct | 240302333244771 |
9 | 43017605714074 |
10 | 11021212011001 |
11 | 356a084948815 |
12 | 129bb9972a0a1 |
13 | 61c3acc3a15a |
14 | 2a16027d6573 |
15 | 141a48a34851 |
hex | a06136d49f9 |
11021212011001 has 8 divisors (see below), whose sum is σ = 11087727041664. Its totient is φ = 10954703168160.
The previous prime is 11021212010989. The next prime is 11021212011031. The reversal of 11021212011001 is 10011021212011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11021212011001 - 211 = 11021212008953 is a prime.
It is a super-2 number, since 2×110212120110012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11021212011031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2051196 + ... + 5123458.
It is an arithmetic number, because the mean of its divisors is an integer number (1385965880208).
Almost surely, 211021212011001 is an apocalyptic number.
It is an amenable number.
11021212011001 is a deficient number, since it is larger than the sum of its proper divisors (66515030663).
11021212011001 is a wasteful number, since it uses less digits than its factorization.
11021212011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3093911.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11021212011001 its reverse (10011021212011), we get a palindrome (21032233223012).
The spelling of 11021212011001 in words is "eleven trillion, twenty-one billion, two hundred twelve million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •