Base | Representation |
---|---|
bin | 110001111010111… |
… | …1011000101110101 |
3 | 11022201221212211222 |
4 | 1203311323011311 |
5 | 11412310030203 |
6 | 434114440125 |
7 | 56336642213 |
oct | 14365730565 |
9 | 4281855758 |
10 | 1675080053 |
11 | 78a5a2489 |
12 | 3a8b93045 |
13 | 20906293a |
14 | 11c679cb3 |
15 | 9c0d0038 |
hex | 63d7b175 |
1675080053 has 2 divisors, whose sum is σ = 1675080054. Its totient is φ = 1675080052.
The previous prime is 1675080019. The next prime is 1675080061. The reversal of 1675080053 is 3500805761.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1115426404 + 559653649 = 33398^2 + 23657^2 .
It is an emirp because it is prime and its reverse (3500805761) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1675080053 - 228 = 1406644597 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1675079995 and 1675080022.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1675080083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 837540026 + 837540027.
It is an arithmetic number, because the mean of its divisors is an integer number (837540027).
Almost surely, 21675080053 is an apocalyptic number.
It is an amenable number.
1675080053 is a deficient number, since it is larger than the sum of its proper divisors (1).
1675080053 is an equidigital number, since it uses as much as digits as its factorization.
1675080053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25200, while the sum is 35.
The square root of 1675080053 is about 40927.7418507300. The cubic root of 1675080053 is about 1187.6227883816.
The spelling of 1675080053 in words is "one billion, six hundred seventy-five million, eighty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •