Base | Representation |
---|---|
bin | 1010000000111011101000… |
… | …0001000100001010001010 |
3 | 1102222122122000200212220012 |
4 | 2200032322001010022022 |
5 | 2420401234214133002 |
6 | 35230234543031522 |
7 | 2214345603615455 |
oct | 240167201041212 |
9 | 42878560625805 |
10 | 11011122021002 |
11 | 3565877359a04 |
12 | 129a04259b5a2 |
13 | 61b46270247c |
14 | 2a0d2672a49c |
15 | 141657cecd52 |
hex | a03ba04428a |
11011122021002 has 8 divisors (see below), whose sum is σ = 16686958114596. Its totient is φ = 5448802649472.
The previous prime is 11011122021001. The next prime is 11011122021013. The reversal of 11011122021002 is 20012022111011.
It can be written as a sum of positive squares in 2 ways, for example, as 10818566927281 + 192555093721 = 3289159^2 + 438811^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×110111220210023 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (11011122021001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28379180273 + ... + 28379180660.
Almost surely, 211011122021002 is an apocalyptic number.
11011122021002 is a deficient number, since it is larger than the sum of its proper divisors (5675836093594).
11011122021002 is an equidigital number, since it uses as much as digits as its factorization.
11011122021002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56758361032.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11011122021002 its reverse (20012022111011), we get a palindrome (31023144132013).
Subtracting 11011122021002 from its reverse (20012022111011), we obtain a palindrome (9000900090009).
The spelling of 11011122021002 in words is "eleven trillion, eleven billion, one hundred twenty-two million, twenty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •