Base | Representation |
---|---|
bin | 101000101101000… |
… | …110011011000111 |
3 | 1202121000111100222 |
4 | 220231012123013 |
5 | 2344311131211 |
6 | 151433054555 |
7 | 22631436266 |
oct | 5055063307 |
9 | 1677014328 |
10 | 682911431 |
11 | 320538514 |
12 | 17085745b |
13 | ab638207 |
14 | 669aa5dd |
15 | 3ee491db |
hex | 28b466c7 |
682911431 has 4 divisors (see below), whose sum is σ = 704940864. Its totient is φ = 660882000.
The previous prime is 682911407. The next prime is 682911461. The reversal of 682911431 is 134119286.
682911431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 682911431 - 26 = 682911367 is a prime.
It is a super-2 number, since 2×6829114312 = 932736045180935522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 682911391 and 682911400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (682911461) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11014670 + ... + 11014731.
It is an arithmetic number, because the mean of its divisors is an integer number (176235216).
Almost surely, 2682911431 is an apocalyptic number.
682911431 is a deficient number, since it is larger than the sum of its proper divisors (22029433).
682911431 is a wasteful number, since it uses less digits than its factorization.
682911431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22029432.
The product of its digits is 10368, while the sum is 35.
The square root of 682911431 is about 26132.5741365063. The cubic root of 682911431 is about 880.6191540608.
The spelling of 682911431 in words is "six hundred eighty-two million, nine hundred eleven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •