Base | Representation |
---|---|
bin | 1100011110000… |
… | …11110010111101 |
3 | 21021211210022200 |
4 | 12033003302331 |
5 | 203240023010 |
6 | 14214102113 |
7 | 2410115232 |
oct | 617036275 |
9 | 237753280 |
10 | 104611005 |
11 | 54060884 |
12 | 2b04a939 |
13 | 18899505 |
14 | dc71789 |
15 | 92b5cc0 |
hex | 63c3cbd |
104611005 has 24 divisors (see below), whose sum is σ = 181872600. Its totient is φ = 55624320.
The previous prime is 104610997. The next prime is 104611007. The reversal of 104611005 is 500116401.
It can be written as a sum of positive squares in 4 ways, for example, as 44796249 + 59814756 = 6693^2 + 7734^2 .
It is not a de Polignac number, because 104611005 - 23 = 104610997 is a prime.
It is a super-2 number, since 2×1046110052 = 21886924734220050, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104611007) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12375 + ... + 19035.
It is an arithmetic number, because the mean of its divisors is an integer number (7578025).
Almost surely, 2104611005 is an apocalyptic number.
104611005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
104611005 is a deficient number, since it is larger than the sum of its proper divisors (77261595).
104611005 is a wasteful number, since it uses less digits than its factorization.
104611005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7021 (or 7018 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The square root of 104611005 is about 10227.9521410691. The cubic root of 104611005 is about 471.1860868276.
Adding to 104611005 its reverse (500116401), we get a palindrome (604727406).
The spelling of 104611005 in words is "one hundred four million, six hundred eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •