Base | Representation |
---|---|
bin | 101101100001010110100… |
… | …0011001110100100111001 |
3 | 211011002210120121220000212 |
4 | 1123002231003032210321 |
5 | 1310001024133444411 |
6 | 21150050031440505 |
7 | 1214002551621113 |
oct | 133025503164471 |
9 | 24132716556025 |
10 | 6256375687481 |
11 | 1aa234aa77007 |
12 | 85063b686135 |
13 | 364c87295a1a |
14 | 178b4b2863b3 |
15 | acb2189968b |
hex | 5b0ad0ce939 |
6256375687481 has 2 divisors, whose sum is σ = 6256375687482. Its totient is φ = 6256375687480.
The previous prime is 6256375687411. The next prime is 6256375687561. The reversal of 6256375687481 is 1847865736526.
6256375687481 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6209520755881 + 46854931600 = 2491891^2 + 216460^2 .
It is a cyclic number.
It is not a de Polignac number, because 6256375687481 - 214 = 6256375671097 is a prime.
It is a super-2 number, since 2×62563756874812 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (6256375687411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3128187843740 + 3128187843741.
It is an arithmetic number, because the mean of its divisors is an integer number (3128187843741).
Almost surely, 26256375687481 is an apocalyptic number.
It is an amenable number.
6256375687481 is a deficient number, since it is larger than the sum of its proper divisors (1).
6256375687481 is an equidigital number, since it uses as much as digits as its factorization.
6256375687481 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 406425600, while the sum is 68.
The spelling of 6256375687481 in words is "six trillion, two hundred fifty-six billion, three hundred seventy-five million, six hundred eighty-seven thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •