Base | Representation |
---|---|
bin | 101000001010101… |
… | …100000110000101 |
3 | 1201222001012020120 |
4 | 220022230012011 |
5 | 2340004000233 |
6 | 150511452153 |
7 | 22461655620 |
oct | 5012540605 |
9 | 1658035216 |
10 | 673890693 |
11 | 316437063 |
12 | 169827059 |
13 | a97ca2b8 |
14 | 656dcdb7 |
15 | 3e2664b3 |
hex | 282ac185 |
673890693 has 32 divisors (see below), whose sum is σ = 1093397760. Its totient is φ = 360391680.
The previous prime is 673890691. The next prime is 673890709. The reversal of 673890693 is 396098376.
It is a happy number.
It is not a de Polignac number, because 673890693 - 21 = 673890691 is a prime.
It is a super-2 number, since 2×6738906932 = 908257332224040498, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (673890691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 59403 + ... + 69831.
It is an arithmetic number, because the mean of its divisors is an integer number (34168680).
Almost surely, 2673890693 is an apocalyptic number.
It is an amenable number.
673890693 is a deficient number, since it is larger than the sum of its proper divisors (419507067).
673890693 is a wasteful number, since it uses less digits than its factorization.
673890693 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10637.
The product of its (nonzero) digits is 1469664, while the sum is 51.
The square root of 673890693 is about 25959.4047119729. The cubic root of 673890693 is about 876.7245197082.
The spelling of 673890693 in words is "six hundred seventy-three million, eight hundred ninety thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •