Base | Representation |
---|---|
bin | 101000101111111… |
… | …110000101111101 |
3 | 1202122102201100022 |
4 | 220233332011331 |
5 | 2400004214431 |
6 | 151501141525 |
7 | 22641021515 |
oct | 5057760575 |
9 | 1678381308 |
10 | 683663741 |
11 | 320a01762 |
12 | 170b5a8a5 |
13 | ab83c777 |
14 | 66b24845 |
15 | 4004707b |
hex | 28bfe17d |
683663741 has 2 divisors, whose sum is σ = 683663742. Its totient is φ = 683663740.
The previous prime is 683663731. The next prime is 683663797. The reversal of 683663741 is 147366386.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 595848100 + 87815641 = 24410^2 + 9371^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-683663741 is a prime.
It is a super-2 number, since 2×6836637412 = 934792221516230162, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 683663692 and 683663701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (683663731) 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, 341831870 + 341831871.
It is an arithmetic number, because the mean of its divisors is an integer number (341831871).
Almost surely, 2683663741 is an apocalyptic number.
It is an amenable number.
683663741 is a deficient number, since it is larger than the sum of its proper divisors (1).
683663741 is an equidigital number, since it uses as much as digits as its factorization.
683663741 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 435456, while the sum is 44.
The square root of 683663741 is about 26146.9642788604. The cubic root of 683663741 is about 880.9424050907.
The spelling of 683663741 in words is "six hundred eighty-three million, six hundred sixty-three thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •