Base | Representation |
---|---|
bin | 11101100000111100000100… |
… | …10100000101110110111011 |
3 | 22111210201010010101211021021 |
4 | 32300132002110011312323 |
5 | 32001334214400133221 |
6 | 350012121041123311 |
7 | 16446055450630141 |
oct | 1660360224056673 |
9 | 274721103354237 |
10 | 64903437114811 |
11 | 19753436249819 |
12 | 7342879929537 |
13 | 2a2a4a2252369 |
14 | 12054b372b591 |
15 | 778449bc4041 |
hex | 3b0782505dbb |
64903437114811 has 2 divisors, whose sum is σ = 64903437114812. Its totient is φ = 64903437114810.
The previous prime is 64903437114751. The next prime is 64903437114829. The reversal of 64903437114811 is 11841173430946.
64903437114811 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 64903437114811 - 223 = 64903428726203 is a prime.
It is a super-2 number, since 2×649034371148112 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (64903437114011) 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, 32451718557405 + 32451718557406.
It is an arithmetic number, because the mean of its divisors is an integer number (32451718557406).
Almost surely, 264903437114811 is an apocalyptic number.
64903437114811 is a deficient number, since it is larger than the sum of its proper divisors (1).
64903437114811 is an equidigital number, since it uses as much as digits as its factorization.
64903437114811 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1741824, while the sum is 52.
The spelling of 64903437114811 in words is "sixty-four trillion, nine hundred three billion, four hundred thirty-seven million, one hundred fourteen thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •