Base | Representation |
---|---|
bin | 1100011110000… |
… | …11110111100101 |
3 | 21021211210201122 |
4 | 12033003313211 |
5 | 203240030201 |
6 | 14214103325 |
7 | 2410116134 |
oct | 617036745 |
9 | 237753648 |
10 | 104611301 |
11 | 54061023 |
12 | 2b04ab45 |
13 | 188996a2 |
14 | dc7191b |
15 | 92b5e1b |
hex | 63c3de5 |
104611301 has 4 divisors (see below), whose sum is σ = 104631852. Its totient is φ = 104590752.
The previous prime is 104611259. The next prime is 104611313. The reversal of 104611301 is 103116401.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 46104100 + 58507201 = 6790^2 + 7649^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104611301 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 104611301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104611601) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3665 + ... + 14921.
It is an arithmetic number, because the mean of its divisors is an integer number (26157963).
Almost surely, 2104611301 is an apocalyptic number.
It is an amenable number.
104611301 is a deficient number, since it is larger than the sum of its proper divisors (20551).
104611301 is an equidigital number, since it uses as much as digits as its factorization.
104611301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20550.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 104611301 is about 10227.9666112087. The cubic root of 104611301 is about 471.1865312389.
Adding to 104611301 its reverse (103116401), we get a palindrome (207727702).
The spelling of 104611301 in words is "one hundred four million, six hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •