Base | Representation |
---|---|
bin | 111111100111110000… |
… | …011011111010010011 |
3 | 20112022211110221011202 |
4 | 333213300123322103 |
5 | 2104401030243241 |
6 | 51214335101415 |
7 | 4635565511462 |
oct | 774760337223 |
9 | 215284427152 |
10 | 68312743571 |
11 | 26a75843376 |
12 | 112a597186b |
13 | 6598a10677 |
14 | 34408ca9d9 |
15 | 1b9c427d9b |
hex | fe7c1be93 |
68312743571 has 2 divisors, whose sum is σ = 68312743572. Its totient is φ = 68312743570.
The previous prime is 68312743531. The next prime is 68312743573. The reversal of 68312743571 is 17534721386.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-68312743571 is a prime.
It is a Sophie Germain prime.
Together with 68312743573, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (68312743573) 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, 34156371785 + 34156371786.
It is an arithmetic number, because the mean of its divisors is an integer number (34156371786).
Almost surely, 268312743571 is an apocalyptic number.
68312743571 is a deficient number, since it is larger than the sum of its proper divisors (1).
68312743571 is an equidigital number, since it uses as much as digits as its factorization.
68312743571 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 846720, while the sum is 47.
The spelling of 68312743571 in words is "sixty-eight billion, three hundred twelve million, seven hundred forty-three thousand, five hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •