Base | Representation |
---|---|
bin | 101000010001011… |
… | …110111010001101 |
3 | 1202002101200022112 |
4 | 220101132322031 |
5 | 2340432443233 |
6 | 151013553405 |
7 | 22513054214 |
oct | 5021367215 |
9 | 1662350275 |
10 | 675671693 |
11 | 317443164 |
12 | 16a345865 |
13 | a9ca1b48 |
14 | 65a4407b |
15 | 3e4b9048 |
hex | 2845ee8d |
675671693 has 2 divisors, whose sum is σ = 675671694. Its totient is φ = 675671692.
The previous prime is 675671687. The next prime is 675671699. The reversal of 675671693 is 396176576.
675671693 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (675671687) and next prime (675671699).
It can be written as a sum of positive squares in only one way, i.e., 511754884 + 163916809 = 22622^2 + 12803^2 .
It is a cyclic number.
It is not a de Polignac number, because 675671693 - 228 = 407236237 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (675671699) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 337835846 + 337835847.
It is an arithmetic number, because the mean of its divisors is an integer number (337835847).
Almost surely, 2675671693 is an apocalyptic number.
It is an amenable number.
675671693 is a deficient number, since it is larger than the sum of its proper divisors (1).
675671693 is an equidigital number, since it uses as much as digits as its factorization.
675671693 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1428840, while the sum is 50.
The square root of 675671693 is about 25993.6856370927. The cubic root of 675671693 is about 877.4961942243.
The spelling of 675671693 in words is "six hundred seventy-five million, six hundred seventy-one thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •