Base | Representation |
---|---|
bin | 110001110000011… |
… | …0011010001010100 |
3 | 11022100112120102210 |
4 | 1203200303101110 |
5 | 11404400333441 |
6 | 433400033420 |
7 | 56241611202 |
oct | 14340632124 |
9 | 4270476383 |
10 | 1669542996 |
11 | 787460400 |
12 | 3a7162870 |
13 | 207b74584 |
14 | 11ba38072 |
15 | 9b889616 |
hex | 63833454 |
1669542996 has 144 divisors (see below), whose sum is σ = 4574561600. Its totient is φ = 472158720.
The previous prime is 1669542991. The next prime is 1669543003. The reversal of 1669542996 is 6992459661.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1669542991) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2013510 + ... + 2014338.
Almost surely, 21669542996 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1669542996, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2287280800).
1669542996 is an abundant number, since it is smaller than the sum of its proper divisors (2905018604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1669542996 is a wasteful number, since it uses less digits than its factorization.
1669542996 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 950 (or 937 counting only the distinct ones).
The product of its digits is 6298560, while the sum is 57.
The square root of 1669542996 is about 40860.0415565134. The cubic root of 1669542996 is about 1186.3127626137.
The spelling of 1669542996 in words is "one billion, six hundred sixty-nine million, five hundred forty-two thousand, nine hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •