Base | Representation |
---|---|
bin | 101000101001100… |
… | …101111111001101 |
3 | 1202112021210100012 |
4 | 220221211333031 |
5 | 2344042222031 |
6 | 151401243005 |
7 | 22620560165 |
oct | 5051457715 |
9 | 1675253305 |
10 | 681992141 |
11 | 31aa6a876 |
12 | 170493465 |
13 | ab3a595c |
14 | 6680b5a5 |
15 | 3ed16b2b |
hex | 28a65fcd |
681992141 has 2 divisors, whose sum is σ = 681992142. Its totient is φ = 681992140.
The previous prime is 681992107. The next prime is 681992147. The reversal of 681992141 is 141299186.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 648975625 + 33016516 = 25475^2 + 5746^2 .
It is a cyclic number.
It is not a de Polignac number, because 681992141 - 210 = 681991117 is a prime.
It is a super-2 number, since 2×6819921412 = 930226560771527762, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (681992147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 340996070 + 340996071.
It is an arithmetic number, because the mean of its divisors is an integer number (340996071).
Almost surely, 2681992141 is an apocalyptic number.
It is an amenable number.
681992141 is a deficient number, since it is larger than the sum of its proper divisors (1).
681992141 is an equidigital number, since it uses as much as digits as its factorization.
681992141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 31104, while the sum is 41.
The square root of 681992141 is about 26114.9792456360. The cubic root of 681992141 is about 880.2238329553.
The spelling of 681992141 in words is "six hundred eighty-one million, nine hundred ninety-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •