Base | Representation |
---|---|
bin | 1100100000011… |
… | …00001110010101 |
3 | 21022101212021020 |
4 | 12100030032111 |
5 | 203324021134 |
6 | 14224311353 |
7 | 2412462156 |
oct | 620141625 |
9 | 238355236 |
10 | 104907669 |
11 | 54243759 |
12 | 2b172559 |
13 | 18971559 |
14 | dd0b92d |
15 | 9323b49 |
hex | 640c395 |
104907669 has 8 divisors (see below), whose sum is σ = 145958592. Its totient is φ = 66897600.
The previous prime is 104907661. The next prime is 104907707. The reversal of 104907669 is 966709401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104907669 - 23 = 104907661 is a prime.
It is a super-2 number, since 2×1049076692 = 22011238030027122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 104907669.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104907661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 760132 + ... + 760269.
It is an arithmetic number, because the mean of its divisors is an integer number (18244824).
Almost surely, 2104907669 is an apocalyptic number.
It is an amenable number.
104907669 is a deficient number, since it is larger than the sum of its proper divisors (41050923).
104907669 is a wasteful number, since it uses less digits than its factorization.
104907669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1520427.
The product of its (nonzero) digits is 81648, while the sum is 42.
The square root of 104907669 is about 10242.4444836182. Note that the first 4 decimals coincide. The cubic root of 104907669 is about 471.6310751292.
The spelling of 104907669 in words is "one hundred four million, nine hundred seven thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •