Base | Representation |
---|---|
bin | 1010000110110011011011… |
… | …1100011100110010111001 |
3 | 1110100022000112120111211111 |
4 | 2201230312330130302321 |
5 | 2424024340031223001 |
6 | 35344441111400321 |
7 | 2224546526234536 |
oct | 241546674346271 |
9 | 43308015514744 |
10 | 11112002211001 |
11 | 35a463461685a |
12 | 12b56b70830a1 |
13 | 627b1b6907a3 |
14 | 2a5b7662bd8d |
15 | 1440ae44e851 |
hex | a1b36f1ccb9 |
11112002211001 has 8 divisors (see below), whose sum is σ = 11121267639744. Its totient is φ = 11102738446800.
The previous prime is 11112002210917. The next prime is 11112002211031. The reversal of 11112002211001 is 10011220021111.
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 11112002211001 - 29 = 11112002210489 is a prime.
It is a super-2 number, since 2×111120022110012 (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 (11112002211031) 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, 13124166 + ... + 13945168.
It is an arithmetic number, because the mean of its divisors is an integer number (1390158454968).
Almost surely, 211112002211001 is an apocalyptic number.
It is an amenable number.
11112002211001 is a deficient number, since it is larger than the sum of its proper divisors (9265428743).
11112002211001 is an equidigital number, since it uses as much as digits as its factorization.
11112002211001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 832271.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11112002211001 its reverse (10011220021111), we get a palindrome (21123222232112).
The spelling of 11112002211001 in words is "eleven trillion, one hundred twelve billion, two million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •