Base | Representation |
---|---|
bin | 101101111100011111111… |
… | …1110011110110011111001 |
3 | 211100200021120120110221112 |
4 | 1123320333332132303321 |
5 | 1311424423332100412 |
6 | 21232531034050105 |
7 | 1221135353111114 |
oct | 133707776366371 |
9 | 24320246513845 |
10 | 6314675268857 |
11 | 201504762541a |
12 | 85b9abb79935 |
13 | 36a61865ac37 |
14 | 17b8bbd8557b |
15 | ae3d4bb4722 |
hex | 5be3ff9ecf9 |
6314675268857 has 2 divisors, whose sum is σ = 6314675268858. Its totient is φ = 6314675268856.
The previous prime is 6314675268823. The next prime is 6314675268877. The reversal of 6314675268857 is 7588625764136.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6271738870336 + 42936398521 = 2504344^2 + 207211^2 .
It is a cyclic number.
It is not a de Polignac number, because 6314675268857 - 26 = 6314675268793 is a prime.
It is a super-2 number, since 2×63146752688572 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (6314675268877) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3157337634428 + 3157337634429.
It is an arithmetic number, because the mean of its divisors is an integer number (3157337634429).
Almost surely, 26314675268857 is an apocalyptic number.
It is an amenable number.
6314675268857 is a deficient number, since it is larger than the sum of its proper divisors (1).
6314675268857 is an equidigital number, since it uses as much as digits as its factorization.
6314675268857 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 6314675268857 in words is "six trillion, three hundred fourteen billion, six hundred seventy-five million, two hundred sixty-eight thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •