Base | Representation |
---|---|
bin | 11100110111110111001100… |
… | …00110010100000100010011 |
3 | 22022210210010022111112211021 |
4 | 32123323212012110010103 |
5 | 31310223223121443321 |
6 | 343011504121100311 |
7 | 16242102415515235 |
oct | 1633734606240423 |
9 | 268723108445737 |
10 | 63492066984211 |
11 | 1925991a63a088 |
12 | 7155230927697 |
13 | 2957378b39c78 |
14 | 1197065024255 |
15 | 751893761941 |
hex | 39bee6194113 |
63492066984211 has 2 divisors, whose sum is σ = 63492066984212. Its totient is φ = 63492066984210.
The previous prime is 63492066984167. The next prime is 63492066984217. The reversal of 63492066984211 is 11248966029436.
63492066984211 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 63492066984211 - 27 = 63492066984083 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 63492066984211.
It is not a weakly prime, because it can be changed into another prime (63492066984217) 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, 31746033492105 + 31746033492106.
It is an arithmetic number, because the mean of its divisors is an integer number (31746033492106).
Almost surely, 263492066984211 is an apocalyptic number.
63492066984211 is a deficient number, since it is larger than the sum of its proper divisors (1).
63492066984211 is an equidigital number, since it uses as much as digits as its factorization.
63492066984211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26873856, while the sum is 61.
The spelling of 63492066984211 in words is "sixty-three trillion, four hundred ninety-two billion, sixty-six million, nine hundred eighty-four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •