Base | Representation |
---|---|
bin | 1010000000010110010111… |
… | …0110011011011110111101 |
3 | 1102221200210222011012020112 |
4 | 2200011211312123132331 |
5 | 2420220243210342341 |
6 | 35221502245155405 |
7 | 2213543003136143 |
oct | 240054566333675 |
9 | 42850728135215 |
10 | 11001120012221 |
11 | 35616044a2749 |
12 | 12981109bbb65 |
13 | 61a52a490891 |
14 | 2a0658203593 |
15 | 14126eb94aeb |
hex | a0165d9b7bd |
11001120012221 has 8 divisors (see below), whose sum is σ = 11196924837120. Its totient is φ = 10806728941008.
The previous prime is 11001120012209. The next prime is 11001120012257. The reversal of 11001120012221 is 12221002110011.
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 11001120012221 - 230 = 11000046270397 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11001120012196 and 11001120012205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001120014221) 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, 353422721 + ... + 353453846.
It is an arithmetic number, because the mean of its divisors is an integer number (1399615604640).
Almost surely, 211001120012221 is an apocalyptic number.
It is an amenable number.
11001120012221 is a deficient number, since it is larger than the sum of its proper divisors (195804824899).
11001120012221 is an equidigital number, since it uses as much as digits as its factorization.
11001120012221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 706876843.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11001120012221 its reverse (12221002110011), we get a palindrome (23222122122232).
The spelling of 11001120012221 in words is "eleven trillion, one billion, one hundred twenty million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •