Base | Representation |
---|---|
bin | 101000001010100… |
… | …100100111010101 |
3 | 1201221222122012202 |
4 | 220022210213111 |
5 | 2340002010203 |
6 | 150511054245 |
7 | 22461500366 |
oct | 5012444725 |
9 | 1657878182 |
10 | 673860053 |
11 | 316416039 |
12 | 169811385 |
13 | a97b9379 |
14 | 656d1b6d |
15 | 3e25c388 |
hex | 282a49d5 |
673860053 has 2 divisors, whose sum is σ = 673860054. Its totient is φ = 673860052.
The previous prime is 673860043. The next prime is 673860091. The reversal of 673860053 is 350068376.
It is an a-pointer prime, because the next prime (673860091) can be obtained adding 673860053 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 441084004 + 232776049 = 21002^2 + 15257^2 .
It is a cyclic number.
It is not a de Polignac number, because 673860053 - 210 = 673859029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 673859989 and 673860016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (673860013) 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 as a sum of consecutive naturals, namely, 336930026 + 336930027.
It is an arithmetic number, because the mean of its divisors is an integer number (336930027).
Almost surely, 2673860053 is an apocalyptic number.
It is an amenable number.
673860053 is a deficient number, since it is larger than the sum of its proper divisors (1).
673860053 is an equidigital number, since it uses as much as digits as its factorization.
673860053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90720, while the sum is 38.
The square root of 673860053 is about 25958.8145530569. The cubic root of 673860053 is about 876.7112320703.
The spelling of 673860053 in words is "six hundred seventy-three million, eight hundred sixty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •