Base | Representation |
---|---|
bin | 101111000001111110011… |
… | …0011110001000101100101 |
3 | 211212221101101000000002102 |
4 | 1132003330303301011211 |
5 | 1321401002243221041 |
6 | 21425243435021445 |
7 | 1234666531341215 |
oct | 136037463610545 |
9 | 24787341000072 |
10 | 6463872242021 |
11 | 2072349405627 |
12 | 8848a989a885 |
13 | 37b70473788c |
14 | 184bd2c20245 |
15 | b321802009b |
hex | 5e0fccf1165 |
6463872242021 has 2 divisors, whose sum is σ = 6463872242022. Its totient is φ = 6463872242020.
The previous prime is 6463872241991. The next prime is 6463872242063. The reversal of 6463872242021 is 1202422783646.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6134964256996 + 328907985025 = 2476886^2 + 573505^2 .
It is a cyclic number.
It is not a de Polignac number, because 6463872242021 - 234 = 6446692372837 is a prime.
It is a super-2 number, since 2×64638722420212 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6463872242071) 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, 3231936121010 + 3231936121011.
It is an arithmetic number, because the mean of its divisors is an integer number (3231936121011).
Almost surely, 26463872242021 is an apocalyptic number.
It is an amenable number.
6463872242021 is a deficient number, since it is larger than the sum of its proper divisors (1).
6463872242021 is an equidigital number, since it uses as much as digits as its factorization.
6463872242021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1548288, while the sum is 47.
The spelling of 6463872242021 in words is "six trillion, four hundred sixty-three billion, eight hundred seventy-two million, two hundred forty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •