Base | Representation |
---|---|
bin | 1010001101101111110110… |
… | …1010101010001101000111 |
3 | 1110202200221122000220000211 |
4 | 2203123331222222031013 |
5 | 2433003200341032221 |
6 | 35515331012220251 |
7 | 2236302043433545 |
oct | 243337552521507 |
9 | 43680848026024 |
10 | 11231300330311 |
11 | 3640193267596 |
12 | 131484b90a687 |
13 | 63615132a729 |
14 | 2ab85266ad95 |
15 | 1472429b06e1 |
hex | a36fdaaa347 |
11231300330311 has 8 divisors (see below), whose sum is σ = 11443394769840. Its totient is φ = 11019212672832.
The previous prime is 11231300330309. The next prime is 11231300330329. The reversal of 11231300330311 is 11303300313211.
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 11231300330311 - 21 = 11231300330309 is a prime.
It is a super-2 number, since 2×112313003303112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11231300330911) 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, 1711876 + ... + 5039158.
It is an arithmetic number, because the mean of its divisors is an integer number (1430424346230).
Almost surely, 211231300330311 is an apocalyptic number.
11231300330311 is a deficient number, since it is larger than the sum of its proper divisors (212094439529).
11231300330311 is an equidigital number, since it uses as much as digits as its factorization.
11231300330311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3391025.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 11231300330311 its reverse (11303300313211), we get a palindrome (22534600643522).
The spelling of 11231300330311 in words is "eleven trillion, two hundred thirty-one billion, three hundred million, three hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •