Base | Representation |
---|---|
bin | 1100011010001… |
… | …11010110110101 |
3 | 21020212220010202 |
4 | 12031013112311 |
5 | 203122220201 |
6 | 14155130245 |
7 | 2402563223 |
oct | 615072665 |
9 | 236786122 |
10 | 104101301 |
11 | 53842937 |
12 | 2aa43985 |
13 | 1874b505 |
14 | db7bb13 |
15 | 9214c6b |
hex | 63475b5 |
104101301 has 4 divisors (see below), whose sum is σ = 104629932. Its totient is φ = 103572672.
The previous prime is 104101297. The next prime is 104101307. The reversal of 104101301 is 103101401.
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 52635025 + 51466276 = 7255^2 + 7174^2 .
It is a cyclic number.
It is not a de Polignac number, because 104101301 - 22 = 104101297 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104101307) 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, 264020 + ... + 264413.
It is an arithmetic number, because the mean of its divisors is an integer number (26157483).
Almost surely, 2104101301 is an apocalyptic number.
It is an amenable number.
104101301 is a deficient number, since it is larger than the sum of its proper divisors (528631).
104101301 is an equidigital number, since it uses as much as digits as its factorization.
104101301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528630.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 104101301 is about 10203.0045084769. The cubic root of 104101301 is about 470.4195755313.
Adding to 104101301 its reverse (103101401), we get a palindrome (207202702).
It can be divided in two parts, 10410 and 1301, that multiplied together give a triangular number (13543410 = T5204).
The spelling of 104101301 in words is "one hundred four million, one hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •