Base | Representation |
---|---|
bin | 110001110000101… |
… | …0001011000101101 |
3 | 11022100202211122102 |
4 | 1203201101120231 |
5 | 11404413310344 |
6 | 433402424445 |
7 | 56242633631 |
oct | 14341213055 |
9 | 4270684572 |
10 | 1669666349 |
11 | 78753504a |
12 | 3a7202125 |
13 | 207bb8770 |
14 | 11ba6adc1 |
15 | 9b8b0e4e |
hex | 6385162d |
1669666349 has 8 divisors (see below), whose sum is σ = 1803200952. Its totient is φ = 1536860160.
The previous prime is 1669666337. The next prime is 1669666379. The reversal of 1669666349 is 9436669661.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 49603849 + 1620062500 = 7043^2 + 40250^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1669666349 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1669666294 and 1669666303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1669666309) 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, 177332 + ... + 186509.
It is an arithmetic number, because the mean of its divisors is an integer number (225400119).
Almost surely, 21669666349 is an apocalyptic number.
It is an amenable number.
1669666349 is a deficient number, since it is larger than the sum of its proper divisors (133534603).
1669666349 is a wasteful number, since it uses less digits than its factorization.
1669666349 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 364207.
The product of its digits is 7558272, while the sum is 56.
The square root of 1669666349 is about 40861.5509862266. The cubic root of 1669666349 is about 1186.3419785199.
The spelling of 1669666349 in words is "one billion, six hundred sixty-nine million, six hundred sixty-six thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •