Base | Representation |
---|---|
bin | 101000001010000… |
… | …000100000000001 |
3 | 1201221201010022002 |
4 | 220022000200001 |
5 | 2334432242004 |
6 | 150503553345 |
7 | 22460313206 |
oct | 5012004001 |
9 | 1657633262 |
10 | 673712129 |
11 | 316324992 |
12 | 16975b855 |
13 | a9766c3c |
14 | 65693cad |
15 | 3e22d61e |
hex | 28280801 |
673712129 has 2 divisors, whose sum is σ = 673712130. Its totient is φ = 673712128.
The previous prime is 673712101. The next prime is 673712131. The reversal of 673712129 is 921217376.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 661878529 + 11833600 = 25727^2 + 3440^2 .
It is a cyclic number.
It is not a de Polignac number, because 673712129 - 216 = 673646593 is a prime.
It is a Sophie Germain prime.
Together with 673712131, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is equal to p34961069 and since 673712129 and 34961069 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 673712092 and 673712101.
It is not a weakly prime, because it can be changed into another prime (673712189) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 336856064 + 336856065.
It is an arithmetic number, because the mean of its divisors is an integer number (336856065).
Almost surely, 2673712129 is an apocalyptic number.
It is an amenable number.
673712129 is a deficient number, since it is larger than the sum of its proper divisors (1).
673712129 is an equidigital number, since it uses as much as digits as its factorization.
673712129 is an evil number, because the sum of its binary digits is even.
The product of its digits is 31752, while the sum is 38.
The square root of 673712129 is about 25955.9651910693. The cubic root of 673712129 is about 876.6470762552.
The spelling of 673712129 in words is "six hundred seventy-three million, seven hundred twelve thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •