Base | Representation |
---|---|
bin | 110000000111001011… |
… | …1101101100011001011 |
3 | 100212200120101200001122 |
4 | 1200032113231203023 |
5 | 3143044444441021 |
6 | 115244212505455 |
7 | 10315242106310 |
oct | 1401627554313 |
9 | 325616350048 |
10 | 103320312011 |
11 | 3a8aa693714 |
12 | 1803591b28b |
13 | 99876841c7 |
14 | 5002006d07 |
15 | 2a4a9a0bab |
hex | 180e5ed8cb |
103320312011 has 8 divisors (see below), whose sum is σ = 120081719040. Its totient is φ = 87059245608.
The previous prime is 103320311999. The next prime is 103320312023. The reversal of 103320312011 is 110213023301.
It is an interprime number because it is at equal distance from previous prime (103320311999) and next prime (103320312023).
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-103320312011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103320312041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 125084711 + ... + 125085536.
It is an arithmetic number, because the mean of its divisors is an integer number (15010214880).
Almost surely, 2103320312011 is an apocalyptic number.
103320312011 is a deficient number, since it is larger than the sum of its proper divisors (16761407029).
103320312011 is an equidigital number, since it uses as much as digits as its factorization.
103320312011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250170313.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 103320312011 its reverse (110213023301), we get a palindrome (213533335312).
The spelling of 103320312011 in words is "one hundred three billion, three hundred twenty million, three hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •