Base | Representation |
---|---|
bin | 1010000010001010100011… |
… | …1110100111001110011011 |
3 | 1110001200022201111122110121 |
4 | 2200202220332213032123 |
5 | 2421223133104031021 |
6 | 35244101304254111 |
7 | 2216025644155345 |
oct | 240425076471633 |
9 | 43050281448417 |
10 | 11032311002011 |
11 | 357385aa48a62 |
12 | 12a2176771337 |
13 | 62045b513c60 |
14 | 2a1d768b4295 |
15 | 141e98129741 |
hex | a08a8fa739b |
11032311002011 has 4 divisors (see below), whose sum is σ = 11880950309872. Its totient is φ = 10183671694152.
The previous prime is 11032311001991. The next prime is 11032311002017. The reversal of 11032311002011 is 11020011323011.
It is a happy number.
11032311002011 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 a de Polignac number, because none of the positive numbers 2k-11032311002011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11032311002017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 424319653911 + ... + 424319653936.
It is an arithmetic number, because the mean of its divisors is an integer number (2970237577468).
Almost surely, 211032311002011 is an apocalyptic number.
11032311002011 is a deficient number, since it is larger than the sum of its proper divisors (848639307861).
11032311002011 is an equidigital number, since it uses as much as digits as its factorization.
11032311002011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 848639307860.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11032311002011 its reverse (11020011323011), we get a palindrome (22052322325022).
The spelling of 11032311002011 in words is "eleven trillion, thirty-two billion, three hundred eleven million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •