Base | Representation |
---|---|
bin | 1010000000011001101110… |
… | …0111010010000001111000 |
3 | 1102221210010211102110221201 |
4 | 2200012123213102001320 |
5 | 2420224120113323000 |
6 | 35222131550143544 |
7 | 2213604235041166 |
oct | 240063347220170 |
9 | 42853124373851 |
10 | 11002022011000 |
11 | 3561a2766a789 |
12 | 1298322ab1bb4 |
13 | 61a642306c77 |
14 | 2a0701d20236 |
15 | 1412c3e6896a |
hex | a019b9d2078 |
11002022011000 has 128 divisors (see below), whose sum is σ = 26604282893760. Its totient is φ = 4255903680000.
The previous prime is 11002022010989. The next prime is 11002022011067. The reversal of 11002022011000 is 11022020011.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3076362 + ... + 5609638.
Almost surely, 211002022011000 is an apocalyptic number.
11002022011000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11002022011000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13302141446880).
11002022011000 is an abundant number, since it is smaller than the sum of its proper divisors (15602260882760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11002022011000 is a wasteful number, since it uses less digits than its factorization.
11002022011000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2533442 (or 2533428 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 11002022011000 its reverse (11022020011), we get a palindrome (11013044031011).
The spelling of 11002022011000 in words is "eleven trillion, two billion, twenty-two million, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •