Base | Representation |
---|---|
bin | 10100100011000000… |
… | …10011101110010111 |
3 | 1001110202221221211210 |
4 | 22101200103232113 |
5 | 140042430202221 |
6 | 5022334432503 |
7 | 540234543210 |
oct | 122140235627 |
9 | 31422857753 |
10 | 11031100311 |
11 | 475084aa30 |
12 | 217a362733 |
13 | 106a4c63ba |
14 | 769088407 |
15 | 448684276 |
hex | 291813b97 |
11031100311 has 64 divisors (see below), whose sum is σ = 19170385920. Its totient is φ = 5471072640.
The previous prime is 11031100303. The next prime is 11031100319. The reversal of 11031100311 is 11300113011.
11031100311 is a nontrivial binomial coefficient, being equal to C(148534, 2).
It is an interprime number because it is at equal distance from previous prime (11031100303) and next prime (11031100319).
It is not a de Polignac number, because 11031100311 - 23 = 11031100303 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11031100319) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3414645 + ... + 3417873.
It is an arithmetic number, because the mean of its divisors is an integer number (299537280).
Almost surely, 211031100311 is an apocalyptic number.
11031100311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11031100311 is the 148533-rd triangular number and also the 74267-th hexagonal number.
11031100311 is a deficient number, since it is larger than the sum of its proper divisors (8139285609).
11031100311 is a wasteful number, since it uses less digits than its factorization.
11031100311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3916.
The product of its (nonzero) digits is 9, while the sum is 12.
Adding to 11031100311 its reverse (11300113011), we get a palindrome (22331213322).
The spelling of 11031100311 in words is "eleven billion, thirty-one million, one hundred thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •