Base | Representation |
---|---|
bin | 101110110001011001100… |
… | …0110010001011111100101 |
3 | 211202112111121002110202022 |
4 | 1131202303012101133211 |
5 | 1320310102103402442 |
6 | 21401035324352525 |
7 | 1232266445045333 |
oct | 135426306213745 |
9 | 24675447073668 |
10 | 6428275840997 |
11 | 205924214468a |
12 | 879a146a5745 |
13 | 378250aa84aa |
14 | 1831b7426b53 |
15 | b2332e333d2 |
hex | 5d8b31917e5 |
6428275840997 has 2 divisors, whose sum is σ = 6428275840998. Its totient is φ = 6428275840996.
The previous prime is 6428275840939. The next prime is 6428275841027. The reversal of 6428275840997 is 7990485728246.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5528113225636 + 900162615361 = 2351194^2 + 948769^2 .
It is a cyclic number.
It is not a de Polignac number, because 6428275840997 - 26 = 6428275840933 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6428275840997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6428275840907) 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, 3214137920498 + 3214137920499.
It is an arithmetic number, because the mean of its divisors is an integer number (3214137920499).
Almost surely, 26428275840997 is an apocalyptic number.
It is an amenable number.
6428275840997 is a deficient number, since it is larger than the sum of its proper divisors (1).
6428275840997 is an equidigital number, since it uses as much as digits as its factorization.
6428275840997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 487710720, while the sum is 71.
The spelling of 6428275840997 in words is "six trillion, four hundred twenty-eight billion, two hundred seventy-five million, eight hundred forty thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •