Base | Representation |
---|---|
bin | 10100100000011111… |
… | …11001001010101011 |
3 | 1001102022021222002221 |
4 | 22100033321022223 |
5 | 140022031120021 |
6 | 5020302534511 |
7 | 536560424464 |
oct | 122017711253 |
9 | 31368258087 |
10 | 11010020011 |
11 | 473a961aa1 |
12 | 2173297437 |
13 | 1066025353 |
14 | 76635bd6b |
15 | 4468bd241 |
hex | 2903f92ab |
11010020011 has 4 divisors (see below), whose sum is σ = 11266067032. Its totient is φ = 10753972992.
The previous prime is 11010019997. The next prime is 11010020051. The reversal of 11010020011 is 11002001011.
11010020011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11010020011 - 27 = 11010019883 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11010019976 and 11010020003.
It is not an unprimeable number, because it can be changed into a prime (11010020051) 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 3 ways as a sum of consecutive naturals, for example, 128023446 + ... + 128023531.
It is an arithmetic number, because the mean of its divisors is an integer number (2816516758).
Almost surely, 211010020011 is an apocalyptic number.
11010020011 is a deficient number, since it is larger than the sum of its proper divisors (256047021).
11010020011 is an equidigital number, since it uses as much as digits as its factorization.
11010020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256047020.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 11010020011 its reverse (11002001011), we get a palindrome (22012021022).
The spelling of 11010020011 in words is "eleven billion, ten million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •