Base | Representation |
---|---|
bin | 1110010011110100… |
… | …11111101001010001 |
3 | 201211102000112112001 |
4 | 13021322133221101 |
5 | 111213211143211 |
6 | 3310155034001 |
7 | 361244233252 |
oct | 71172375121 |
9 | 21742015461 |
10 | 7682521681 |
11 | 329264627a |
12 | 15a4a3b901 |
13 | 955835923 |
14 | 52c464b29 |
15 | 2ee6d7ac1 |
hex | 1c9e9fa51 |
7682521681 has 2 divisors, whose sum is σ = 7682521682. Its totient is φ = 7682521680.
The previous prime is 7682521669. The next prime is 7682521687. The reversal of 7682521681 is 1861252867.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5544291600 + 2138230081 = 74460^2 + 46241^2 .
It is an emirp because it is prime and its reverse (1861252867) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 7682521681 - 227 = 7548303953 is a prime.
It is a super-2 number, since 2×76825216812 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (7682521687) 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, 3841260840 + 3841260841.
It is an arithmetic number, because the mean of its divisors is an integer number (3841260841).
Almost surely, 27682521681 is an apocalyptic number.
It is an amenable number.
7682521681 is a deficient number, since it is larger than the sum of its proper divisors (1).
7682521681 is an equidigital number, since it uses as much as digits as its factorization.
7682521681 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 322560, while the sum is 46.
The square root of 7682521681 is about 87649.9953280090. The cubic root of 7682521681 is about 1973.1855733393.
The spelling of 7682521681 in words is "seven billion, six hundred eighty-two million, five hundred twenty-one thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •