Base | Representation |
---|---|
bin | 110001111011000… |
… | …0001101011101101 |
3 | 11022202000020212222 |
4 | 1203312001223231 |
5 | 11412311411203 |
6 | 434115205125 |
7 | 56340114014 |
oct | 14366015355 |
9 | 4282006788 |
10 | 1675107053 |
11 | 78a6107a4 |
12 | 3a8ba67a5 |
13 | 209072009 |
14 | 11c685a7b |
15 | 9c0d8038 |
hex | 63d81aed |
1675107053 has 8 divisors (see below), whose sum is σ = 1775098872. Its totient is φ = 1575277056.
The previous prime is 1675107037. The next prime is 1675107059. The reversal of 1675107053 is 3507015761.
It can be written as a sum of positive squares in 4 ways, for example, as 956170084 + 718936969 = 30922^2 + 26813^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1675107053 - 24 = 1675107037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1675107059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18800 + ... + 60857.
It is an arithmetic number, because the mean of its divisors is an integer number (221887359).
Almost surely, 21675107053 is an apocalyptic number.
It is an amenable number.
1675107053 is a deficient number, since it is larger than the sum of its proper divisors (99991819).
1675107053 is a wasteful number, since it uses less digits than its factorization.
1675107053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80911.
The product of its (nonzero) digits is 22050, while the sum is 35.
The square root of 1675107053 is about 40928.0716990185. The cubic root of 1675107053 is about 1187.6291692992.
The spelling of 1675107053 in words is "one billion, six hundred seventy-five million, one hundred seven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •