Base | Representation |
---|---|
bin | 101000101111111… |
… | …101100001000001 |
3 | 1202122102121002202 |
4 | 220233331201001 |
5 | 2400004131002 |
6 | 151501122545 |
7 | 22641011600 |
oct | 5057754101 |
9 | 1678377082 |
10 | 683661377 |
11 | 3209aaa03 |
12 | 170b59455 |
13 | ab83b679 |
14 | 66b23a37 |
15 | 40046502 |
hex | 28bfd841 |
683661377 has 18 divisors (see below), whose sum is σ = 801815238. Its totient is φ = 581210112.
The previous prime is 683661371. The next prime is 683661397. The reversal of 683661377 is 773166386.
683661377 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 106172416 + 577488961 = 10304^2 + 24031^2 .
It is not a de Polignac number, because 683661377 - 214 = 683644993 is a prime.
It is a super-2 number, since 2×6836613772 = 934785756803072258, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (683661371) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 2660033 + ... + 2660289.
It is an arithmetic number, because the mean of its divisors is an integer number (44545291).
Almost surely, 2683661377 is an apocalyptic number.
It is an amenable number.
683661377 is a deficient number, since it is larger than the sum of its proper divisors (118153861).
683661377 is an equidigital number, since it uses as much as digits as its factorization.
683661377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 737 (or 497 counting only the distinct ones).
The product of its digits is 762048, while the sum is 47.
The square root of 683661377 is about 26146.9190728086. The cubic root of 683661377 is about 880.9413897035.
The spelling of 683661377 in words is "six hundred eighty-three million, six hundred sixty-one thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •