Base | Representation |
---|---|
bin | 111111101001110101… |
… | …111110000010110011 |
3 | 20112102021100100221202 |
4 | 333221311332002303 |
5 | 2104434010423111 |
6 | 51222025241415 |
7 | 4636502163656 |
oct | 775165760263 |
9 | 215367310852 |
10 | 68347748531 |
11 | 26a93582097 |
12 | 112b563326b |
13 | 65a304876a |
14 | 34453dd89d |
15 | 1ba053eb3b |
hex | fe9d7e0b3 |
68347748531 has 2 divisors, whose sum is σ = 68347748532. Its totient is φ = 68347748530.
The previous prime is 68347748509. The next prime is 68347748587. The reversal of 68347748531 is 13584774386.
It is a happy number.
It is an a-pointer prime, because the next prime (68347748587) can be obtained adding 68347748531 to its sum of digits (56).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-68347748531 is a prime.
It is a super-2 number, since 2×683477485312 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (68347748501) 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, 34173874265 + 34173874266.
It is an arithmetic number, because the mean of its divisors is an integer number (34173874266).
Almost surely, 268347748531 is an apocalyptic number.
68347748531 is a deficient number, since it is larger than the sum of its proper divisors (1).
68347748531 is an equidigital number, since it uses as much as digits as its factorization.
68347748531 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13547520, while the sum is 56.
The spelling of 68347748531 in words is "sixty-eight billion, three hundred forty-seven million, seven hundred forty-eight thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •