Base | Representation |
---|---|
bin | 1010000001011101110100… |
… | …1111110011100011100111 |
3 | 1110000112022212101002000201 |
4 | 2200113131033303203213 |
5 | 2421024040033203221 |
6 | 35234353551451331 |
7 | 2215122245055232 |
oct | 240273517634347 |
9 | 43015285332021 |
10 | 11020303022311 |
11 | 35697588370a0 |
12 | 129b985226b47 |
13 | 61c29681731b |
14 | 2a1557bba419 |
15 | 1419e3d2e891 |
hex | a05dd3f38e7 |
11020303022311 has 8 divisors (see below), whose sum is σ = 12409960002048. Its totient is φ = 9695281251000.
The previous prime is 11020303022297. The next prime is 11020303022329. The reversal of 11020303022311 is 11322030302011.
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 11020303022311 - 217 = 11020302891239 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020303025311) 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, 16158801745 + ... + 16158802426.
It is an arithmetic number, because the mean of its divisors is an integer number (1551245000256).
Almost surely, 211020303022311 is an apocalyptic number.
11020303022311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11020303022311 is a deficient number, since it is larger than the sum of its proper divisors (1389656979737).
11020303022311 is a wasteful number, since it uses less digits than its factorization.
11020303022311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32317604213.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 11020303022311 its reverse (11322030302011), we get a palindrome (22342333324322).
The spelling of 11020303022311 in words is "eleven trillion, twenty billion, three hundred three million, twenty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •