Base | Representation |
---|---|
bin | 1100000010100011… |
… | …11110111101011101 |
3 | 121200111001022010112 |
4 | 12001101332331131 |
5 | 101214232124433 |
6 | 2545224415405 |
7 | 316116414251 |
oct | 60121767535 |
9 | 17614038115 |
10 | 6463942493 |
11 | 28177aa738 |
12 | 1304917565 |
13 | 7c0237958 |
14 | 45469a261 |
15 | 27c72c348 |
hex | 18147ef5d |
6463942493 has 2 divisors, whose sum is σ = 6463942494. Its totient is φ = 6463942492.
The previous prime is 6463942483. The next prime is 6463942523. The reversal of 6463942493 is 3942493646.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5343902404 + 1120040089 = 73102^2 + 33467^2 .
It is a cyclic number.
It is not a de Polignac number, because 6463942493 - 216 = 6463876957 is a prime.
It is a super-2 number, since 2×64639424932 = 83565105105622110098, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6463942483) 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, 3231971246 + 3231971247.
It is an arithmetic number, because the mean of its divisors is an integer number (3231971247).
Almost surely, 26463942493 is an apocalyptic number.
It is an amenable number.
6463942493 is a deficient number, since it is larger than the sum of its proper divisors (1).
6463942493 is an equidigital number, since it uses as much as digits as its factorization.
6463942493 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3359232, while the sum is 50.
The square root of 6463942493 is about 80398.6473331486. The cubic root of 6463942493 is about 1862.7982789582.
The spelling of 6463942493 in words is "six billion, four hundred sixty-three million, nine hundred forty-two thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •