Base | Representation |
---|---|
bin | 10101000100010010… |
… | …00000110110101001 |
3 | 1002012020011000101111 |
4 | 22202021000312221 |
5 | 141130403101002 |
6 | 5110144550321 |
7 | 550164111421 |
oct | 124211006651 |
9 | 32166130344 |
10 | 11310206377 |
11 | 48843534a8 |
12 | 22379223a1 |
13 | 10b3289c12 |
14 | 79417d481 |
15 | 462e173d7 |
hex | 2a2240da9 |
11310206377 has 8 divisors (see below), whose sum is σ = 11702028800. Its totient is φ = 10920070080.
The previous prime is 11310206371. The next prime is 11310206423. The reversal of 11310206377 is 77360201311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11310206377 is a prime.
It is a super-2 number, since 2×113102063772 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is not an unprimeable number, because it can be changed into a prime (11310206371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 407877 + ... + 434722.
It is an arithmetic number, because the mean of its divisors is an integer number (1462753600).
Almost surely, 211310206377 is an apocalyptic number.
It is an amenable number.
11310206377 is a deficient number, since it is larger than the sum of its proper divisors (391822423).
11310206377 is an equidigital number, since it uses as much as digits as its factorization.
11310206377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 843063.
The product of its (nonzero) digits is 5292, while the sum is 31.
Adding to 11310206377 its reverse (77360201311), we get a palindrome (88670407688).
The spelling of 11310206377 in words is "eleven billion, three hundred ten million, two hundred six thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •