Base | Representation |
---|---|
bin | 1010000001011100110001… |
… | …1000001010100011101000 |
3 | 1110000111121010211002202221 |
4 | 2200113030120022203220 |
5 | 2421023000110013000 |
6 | 35234305521403424 |
7 | 2215112240322223 |
oct | 240271430124350 |
9 | 43014533732687 |
10 | 11020020001000 |
11 | 3569622aa9a8a |
12 | 129b906499574 |
13 | 61c24ccb26aa |
14 | 2a152c3865ba |
15 | 1419c907661a |
hex | a05cc60a8e8 |
11020020001000 has 32 divisors (see below), whose sum is σ = 25786846804680. Its totient is φ = 4408008000000.
The previous prime is 11020020000971. The next prime is 11020020001009. The reversal of 11020020001000 is 10002002011.
It can be written as a sum of positive squares in 4 ways, for example, as 479309751684 + 10540710249316 = 692322^2 + 3246646^2 .
It is not an unprimeable number, because it can be changed into a prime (11020020001009) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 5510009001 + ... + 5510011000.
Almost surely, 211020020001000 is an apocalyptic number.
11020020001000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11020020001000 is an abundant number, since it is smaller than the sum of its proper divisors (14766826803680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020020001000 is a wasteful number, since it uses less digits than its factorization.
11020020001000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11020020022 (or 11020020008 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 11020020001000 its reverse (10002002011), we get a palindrome (11030022003011).
The spelling of 11020020001000 in words is "eleven trillion, twenty billion, twenty million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •