Base | Representation |
---|---|
bin | 101110111111000011111… |
… | …0011010011111101010101 |
3 | 211212100020020102121022022 |
4 | 1131332013303103331111 |
5 | 1321300143220034031 |
6 | 21422330443542525 |
7 | 1234355462133326 |
oct | 135760763237525 |
9 | 24770206377268 |
10 | 6457614221141 |
11 | 206a727972946 |
12 | 883641b2aa45 |
13 | 37ac4807b645 |
14 | 18479ba4844d |
15 | b2e9d91b97b |
hex | 5df87cd3f55 |
6457614221141 has 2 divisors, whose sum is σ = 6457614221142. Its totient is φ = 6457614221140.
The previous prime is 6457614221117. The next prime is 6457614221147. The reversal of 6457614221141 is 1411224167546.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6451960685041 + 5653536100 = 2540071^2 + 75190^2 .
It is a cyclic number.
It is not a de Polignac number, because 6457614221141 - 210 = 6457614220117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6457614221092 and 6457614221101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6457614221147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3228807110570 + 3228807110571.
It is an arithmetic number, because the mean of its divisors is an integer number (3228807110571).
Almost surely, 26457614221141 is an apocalyptic number.
It is an amenable number.
6457614221141 is a deficient number, since it is larger than the sum of its proper divisors (1).
6457614221141 is an equidigital number, since it uses as much as digits as its factorization.
6457614221141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 322560, while the sum is 44.
Adding to 6457614221141 its reverse (1411224167546), we get a palindrome (7868838388687).
The spelling of 6457614221141 in words is "six trillion, four hundred fifty-seven billion, six hundred fourteen million, two hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •