Base | Representation |
---|---|
bin | 1010000000010010111100… |
… | …0000110111100111011011 |
3 | 1102221121102211222211111022 |
4 | 2200010233000313213123 |
5 | 2420211402200031021 |
6 | 35221231102153055 |
7 | 2213511132156503 |
oct | 240045700674733 |
9 | 42847384884438 |
10 | 11000200002011 |
11 | 3561182143430 |
12 | 1297ab488278b |
13 | 61a4119ac23c |
14 | 2a05abd58a03 |
15 | 1412190141ab |
hex | a012f0379db |
11000200002011 has 8 divisors (see below), whose sum is σ = 12026476872624. Its totient is φ = 9978299579520.
The previous prime is 11000200001993. The next prime is 11000200002013. The reversal of 11000200002011 is 11020000200011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11000200002011 - 226 = 11000132893147 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11000200002011.
It is not an unprimeable number, because it can be changed into a prime (11000200002013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1094106770 + ... + 1094116823.
It is an arithmetic number, because the mean of its divisors is an integer number (1503309609078).
Almost surely, 211000200002011 is an apocalyptic number.
11000200002011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11000200002011 is a deficient number, since it is larger than the sum of its proper divisors (1026276870613).
11000200002011 is a wasteful number, since it uses less digits than its factorization.
11000200002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2188224061.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 11000200002011 its reverse (11020000200011), we get a palindrome (22020200202022).
The spelling of 11000200002011 in words is "eleven trillion, two hundred million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.977 sec. • engine limits •