Base | Representation |
---|---|
bin | 101000101001011… |
… | …111000101001101 |
3 | 1202112020100112111 |
4 | 220221133011031 |
5 | 2344040320403 |
6 | 151400504021 |
7 | 22620411544 |
oct | 5051370515 |
9 | 1675210474 |
10 | 681963853 |
11 | 31aa5059a |
12 | 17047b011 |
13 | ab395b0c |
14 | 6680115b |
15 | 3ed0d56d |
hex | 28a5f14d |
681963853 has 2 divisors, whose sum is σ = 681963854. Its totient is φ = 681963852.
The previous prime is 681963851. The next prime is 681963859. The reversal of 681963853 is 358369186.
681963853 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 654694569 + 27269284 = 25587^2 + 5222^2 .
It is a cyclic number.
It is not a de Polignac number, because 681963853 - 21 = 681963851 is a prime.
Together with 681963851, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 681963797 and 681963806.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (681963851) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 340981926 + 340981927.
It is an arithmetic number, because the mean of its divisors is an integer number (340981927).
Almost surely, 2681963853 is an apocalyptic number.
It is an amenable number.
681963853 is a deficient number, since it is larger than the sum of its proper divisors (1).
681963853 is an equidigital number, since it uses as much as digits as its factorization.
681963853 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 933120, while the sum is 49.
The square root of 681963853 is about 26114.4376351473. The cubic root of 681963853 is about 880.2116626703.
The spelling of 681963853 in words is "six hundred eighty-one million, nine hundred sixty-three thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •