Base | Representation |
---|---|
bin | 110000000110111001… |
… | …0101100000111010101 |
3 | 100212122220010121000120 |
4 | 1200031302230013111 |
5 | 3143040003404210 |
6 | 115243224502153 |
7 | 10315063445250 |
oct | 1401562540725 |
9 | 325586117016 |
10 | 103310606805 |
11 | 3a8a5164a8a |
12 | 1803261a959 |
13 | 9985666893 |
14 | 50009dc097 |
15 | 2a49bd5270 |
hex | 180dcac1d5 |
103310606805 has 96 divisors (see below), whose sum is σ = 192946800384. Its totient is φ = 46238976000.
The previous prime is 103310606803. The next prime is 103310606813. The reversal of 103310606805 is 508606013301.
It is not a de Polignac number, because 103310606805 - 21 = 103310606803 is a prime.
It is a super-3 number, since 3×1033106068053 (a number of 34 digits) contains 333 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103310606803) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 109787635 + ... + 109788575.
It is an arithmetic number, because the mean of its divisors is an integer number (2009862504).
Almost surely, 2103310606805 is an apocalyptic number.
103310606805 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
103310606805 is a deficient number, since it is larger than the sum of its proper divisors (89636193579).
103310606805 is an equidigital number, since it uses as much as digits as its factorization.
103310606805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1359 (or 1298 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 33.
The spelling of 103310606805 in words is "one hundred three billion, three hundred ten million, six hundred six thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •