Base | Representation |
---|---|
bin | 1010000000111001101011… |
… | …1101100010000000101000 |
3 | 1102222121021201022022211002 |
4 | 2200032122331202000220 |
5 | 2420344202324013000 |
6 | 35230111131454132 |
7 | 2214326646203636 |
oct | 240163275420050 |
9 | 42877251268732 |
10 | 11010601001000 |
11 | 356562a245967 |
12 | 1299b17bb7348 |
13 | 61b3ab79a903 |
14 | 2a0cb7462356 |
15 | 1416271d18d5 |
hex | a039af62028 |
11010601001000 has 64 divisors (see below), whose sum is σ = 25765377140880. Its totient is φ = 4404142828800.
The previous prime is 11010601000909. The next prime is 11010601001011. The reversal of 11010601001000 is 10010601011.
It can be written as a sum of positive squares in 8 ways, for example, as 2020042523524 + 8990558477476 = 1421282^2 + 2998426^2 .
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 15 ways as a sum of consecutive naturals, for example, 59704934 + ... + 59889066.
Almost surely, 211010601001000 is an apocalyptic number.
11010601001000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11010601001000 is an abundant number, since it is smaller than the sum of its proper divisors (14754776139880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010601001000 is a wasteful number, since it uses less digits than its factorization.
11010601001000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243951 (or 243937 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 11010601001000 its reverse (10010601011), we get a palindrome (11020611602011).
The spelling of 11010601001000 in words is "eleven trillion, ten billion, six hundred one million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •