Base | Representation |
---|---|
bin | 1010000000011010011011… |
… | …0100110010011100001000 |
3 | 1102221210121221100102221000 |
4 | 2200012212310302130020 |
5 | 2420230011241213000 |
6 | 35222202345415000 |
7 | 2213612010552426 |
oct | 240064664623410 |
9 | 42853557312830 |
10 | 11002210101000 |
11 | 3562013858568 |
12 | 1298375a9a460 |
13 | 61a672281221 |
14 | 2a071ccc2116 |
15 | 1412d571e000 |
hex | a01a6d32708 |
11002210101000 has 128 divisors (see below), whose sum is σ = 38140995110400. Its totient is φ = 2933922686400.
The previous prime is 11002210100951. The next prime is 11002210101011. The reversal of 11002210101000 is 10101220011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 203717632 + ... + 203771631.
It is an arithmetic number, because the mean of its divisors is an integer number (297976524300).
Almost surely, 211002210101000 is an apocalyptic number.
11002210101000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11002210101000 is an abundant number, since it is smaller than the sum of its proper divisors (27138785009400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11002210101000 is a wasteful number, since it uses less digits than its factorization.
11002210101000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 407489293 (or 407489273 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11002210101000 its reverse (10101220011), we get a palindrome (11012311321011).
The spelling of 11002210101000 in words is "eleven trillion, two billion, two hundred ten million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •