Base | Representation |
---|---|
bin | 1100011110110… |
… | …11110111000001 |
3 | 21022000210112012 |
4 | 12033123313001 |
5 | 203301201234 |
6 | 14220142305 |
7 | 2411005466 |
oct | 617336701 |
9 | 238023465 |
10 | 104709569 |
11 | 54118938 |
12 | 2b097995 |
13 | 18902333 |
14 | dc9966d |
15 | 92d50ce |
hex | 63dbdc1 |
104709569 has 4 divisors (see below), whose sum is σ = 104733396. Its totient is φ = 104685744.
The previous prime is 104709557. The next prime is 104709581. The reversal of 104709569 is 965907401.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (104709557) and next prime (104709581).
It can be written as a sum of positive squares in 2 ways, for example, as 86731969 + 17977600 = 9313^2 + 4240^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104709569 is a prime.
It is a super-2 number, since 2×1047095692 = 21928187680331522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104709509) 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, 3194 + ... + 14819.
It is an arithmetic number, because the mean of its divisors is an integer number (26183349).
Almost surely, 2104709569 is an apocalyptic number.
It is an amenable number.
104709569 is a deficient number, since it is larger than the sum of its proper divisors (23827).
104709569 is an equidigital number, since it uses as much as digits as its factorization.
104709569 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23826.
The product of its (nonzero) digits is 68040, while the sum is 41.
The square root of 104709569 is about 10232.7693709963. The cubic root of 104709569 is about 471.3340234852.
The spelling of 104709569 in words is "one hundred four million, seven hundred nine thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •