Base | Representation |
---|---|
bin | 1010000000010110010101… |
… | …0001000101000011001001 |
3 | 1102221200210021201202012202 |
4 | 2200011211101011003021 |
5 | 2420220233204033001 |
6 | 35221501255245545 |
7 | 2213542523666255 |
oct | 240054521050311 |
9 | 42850707652182 |
10 | 11001110221001 |
11 | 35615a9a1542a |
12 | 12981096798b5 |
13 | 61a528443064 |
14 | 2a0656bb5265 |
15 | 14126ddad96b |
hex | a01654450c9 |
11001110221001 has 8 divisors (see below), whose sum is σ = 11181077779200. Its totient is φ = 10822500908928.
The previous prime is 11001110220917. The next prime is 11001110221021. The reversal of 11001110221001 is 10012201110011.
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 11001110221001 - 242 = 6603063709897 is a prime.
It is a super-2 number, since 2×110011102210012 (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 (11001110221021) 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, 339545201 + ... + 339577598.
It is an arithmetic number, because the mean of its divisors is an integer number (1397634722400).
Almost surely, 211001110221001 is an apocalyptic number.
It is an amenable number.
11001110221001 is a deficient number, since it is larger than the sum of its proper divisors (179967558199).
11001110221001 is an equidigital number, since it uses as much as digits as its factorization.
11001110221001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 679123063.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11001110221001 its reverse (10012201110011), we get a palindrome (21013311331012).
The spelling of 11001110221001 in words is "eleven trillion, one billion, one hundred ten million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •