Base | Representation |
---|---|
bin | 1010000000111110111001… |
… | …0110010111011000101011 |
3 | 1102222201220012210212010000 |
4 | 2200033232112113120223 |
5 | 2420410034001120021 |
6 | 35230502025354043 |
7 | 2214406424522364 |
oct | 240175626273053 |
9 | 42881805725100 |
10 | 11012000020011 |
11 | 3566187a24621 |
12 | 129a248638923 |
13 | 61b572594a03 |
14 | 2a0dab19ab6b |
15 | 1416a9e30b26 |
hex | a03ee59762b |
11012000020011 has 10 divisors (see below), whose sum is σ = 16450024721372. Its totient is φ = 7341333346620.
The previous prime is 11012000019931. The next prime is 11012000020027. The reversal of 11012000020011 is 11002000021011.
It is a happy number.
It is not a de Polignac number, because 11012000020011 - 218 = 11011999757867 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11012000019975 and 11012000020002.
It is not an unprimeable number, because it can be changed into a prime (11012000020061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 67975308685 + ... + 67975308846.
Almost surely, 211012000020011 is an apocalyptic number.
11012000020011 is a deficient number, since it is larger than the sum of its proper divisors (5438024701361).
11012000020011 is an equidigital number, since it uses as much as digits as its factorization.
11012000020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135950617543 (or 135950617534 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11012000020011 its reverse (11002000021011), we get a palindrome (22014000041022).
The spelling of 11012000020011 in words is "eleven trillion, twelve billion, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •