Base | Representation |
---|---|
bin | 1100011101110… |
… | …01101010011101 |
3 | 21021202200101111 |
4 | 12032321222131 |
5 | 203232211001 |
6 | 14213142021 |
7 | 2406553231 |
oct | 616715235 |
9 | 237680344 |
10 | 104569501 |
11 | 54032683 |
12 | 2b02a911 |
13 | 1888365a |
14 | dc605c1 |
15 | 92a8851 |
hex | 63b9a9d |
104569501 has 8 divisors (see below), whose sum is σ = 106942464. Its totient is φ = 102202800.
The previous prime is 104569489. The next prime is 104569519. The reversal of 104569501 is 105965401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a 3-Lehmer number, since φ(104569501) divides (104569501-1)3.
It is a cyclic number.
It is a Carmichael number.
It is a de Polignac number, because none of the positive numbers 2k-104569501 is a prime.
It is a super-3 number, since 3×1045695013 (a number of 25 digits) contains 333 as substring.
It is a deceptive number, since it divides R104569500.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104569301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53131 + ... + 55063.
It is an arithmetic number, because the mean of its divisors is an integer number (13367808).
It is a Poulet number, since it divides 2104569500-1.
Almost surely, 2104569501 is an apocalyptic number.
It is an amenable number.
104569501 is a deficient number, since it is larger than the sum of its proper divisors (2372963).
104569501 is a wasteful number, since it uses less digits than its factorization.
104569501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3131.
The product of its (nonzero) digits is 5400, while the sum is 31.
The square root of 104569501 is about 10225.9229901266. The cubic root of 104569501 is about 471.1237648498.
The spelling of 104569501 in words is "one hundred four million, five hundred sixty-nine thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.215 sec. • engine limits •