Base | Representation |
---|---|
bin | 10100011111010101… |
… | …11001000000010100 |
3 | 1001101122001011020000 |
4 | 22033222321000110 |
5 | 140012040220040 |
6 | 5015315011300 |
7 | 536412114564 |
oct | 121752710024 |
9 | 31348034200 |
10 | 11000320020 |
11 | 4735437278 |
12 | 216bb99b30 |
13 | 106400a201 |
14 | 764d54da4 |
15 | 445b04130 |
hex | 28fab9014 |
11000320020 has 120 divisors (see below), whose sum is σ = 35698509000. Its totient is φ = 2832254208.
The previous prime is 11000320007. The next prime is 11000320099. The reversal of 11000320020 is 2002300011.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 302968836 + 10697351184 = 17406^2 + 103428^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11000319984 and 11000320011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 70095 + ... + 164054.
It is an arithmetic number, because the mean of its divisors is an integer number (297487575).
Almost surely, 211000320020 is an apocalyptic number.
11000320020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11000320020 is an abundant number, since it is smaller than the sum of its proper divisors (24698188980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000320020 is a wasteful number, since it uses less digits than its factorization.
11000320020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234199 (or 234188 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 11000320020 its reverse (2002300011), we get a palindrome (13002620031).
The spelling of 11000320020 in words is "eleven billion, three hundred twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •