Base | Representation |
---|---|
bin | 100000000110011110… |
… | …0100011000011101111 |
3 | 20120221022111221222012 |
4 | 1000030330203003233 |
5 | 2112140242104232 |
6 | 51400304111435 |
7 | 4660213034264 |
oct | 1001474430357 |
9 | 216838457865 |
10 | 68936675567 |
11 | 27265a57751 |
12 | 1143a90557b |
13 | 66680682b6 |
14 | 349d70326b |
15 | 1bd70c19b2 |
hex | 100cf230ef |
68936675567 has 2 divisors, whose sum is σ = 68936675568. Its totient is φ = 68936675566.
The previous prime is 68936675557. The next prime is 68936675611. The reversal of 68936675567 is 76557663986.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-68936675567 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 68936675497 and 68936675506.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (68936675527) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 34468337783 + 34468337784.
It is an arithmetic number, because the mean of its divisors is an integer number (34468337784).
Almost surely, 268936675567 is an apocalyptic number.
68936675567 is a deficient number, since it is larger than the sum of its proper divisors (1).
68936675567 is an equidigital number, since it uses as much as digits as its factorization.
68936675567 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 342921600, while the sum is 68.
The spelling of 68936675567 in words is "sixty-eight billion, nine hundred thirty-six million, six hundred seventy-five thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •