Base | Representation |
---|---|
bin | 1100101101111011101101… |
… | …00111010100000011000001 |
3 | 10200000120111000020102211122 |
4 | 12112331312213110003001 |
5 | 12131200414123101343 |
6 | 135251350510122025 |
7 | 5614341326311133 |
oct | 626756647240301 |
9 | 120016430212748 |
10 | 27966522081473 |
11 | 8a025986a1608 |
12 | 31781237b0315 |
13 | 127b302108141 |
14 | 6c9830601053 |
15 | 337717bc8068 |
hex | 196f769d40c1 |
27966522081473 has 2 divisors, whose sum is σ = 27966522081474. Its totient is φ = 27966522081472.
The previous prime is 27966522081469. The next prime is 27966522081503. The reversal of 27966522081473 is 37418022566972.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 26437767882289 + 1528754199184 = 5141767^2 + 1236428^2 .
It is a cyclic number.
It is not a de Polignac number, because 27966522081473 - 22 = 27966522081469 is a prime.
It is not a weakly prime, because it can be changed into another prime (27966522041473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13983261040736 + 13983261040737.
It is an arithmetic number, because the mean of its divisors is an integer number (13983261040737).
It is a 1-persistent number, because it is pandigital, but 2⋅27966522081473 = 55933044162946 is not.
Almost surely, 227966522081473 is an apocalyptic number.
It is an amenable number.
27966522081473 is a deficient number, since it is larger than the sum of its proper divisors (1).
27966522081473 is an equidigital number, since it uses as much as digits as its factorization.
27966522081473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60963840, while the sum is 62.
The spelling of 27966522081473 in words is "twenty-seven trillion, nine hundred sixty-six billion, five hundred twenty-two million, eighty-one thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •