Base | Representation |
---|---|
bin | 111111110001010111… |
… | …011111010010011100 |
3 | 20112202001212101102212 |
4 | 333301113133102130 |
5 | 2110213314212324 |
6 | 51242334535552 |
7 | 4642564122662 |
oct | 776127372234 |
9 | 215661771385 |
10 | 68473975964 |
11 | 27048857689 |
12 | 1132b9675b8 |
13 | 65c3243054 |
14 | 345809ac32 |
15 | 1bab67570e |
hex | ff15df49c |
68473975964 has 24 divisors (see below), whose sum is σ = 119987471520. Its totient is φ = 34191876096.
The previous prime is 68473975961. The next prime is 68473975967. The reversal of 68473975964 is 46957937486.
It is an interprime number because it is at equal distance from previous prime (68473975961) and next prime (68473975967).
It is a Smith number, since the sum of its digits (68) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 68473975894 and 68473975903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68473975961) 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 in 7 ways as a sum of consecutive naturals, for example, 14701124 + ... + 14705780.
It is an arithmetic number, because the mean of its divisors is an integer number (4999477980).
Almost surely, 268473975964 is an apocalyptic number.
It is an amenable number.
68473975964 is a deficient number, since it is larger than the sum of its proper divisors (51513495556).
68473975964 is a wasteful number, since it uses less digits than its factorization.
68473975964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8717 (or 8715 counting only the distinct ones).
The product of its digits is 274337280, while the sum is 68.
The spelling of 68473975964 in words is "sixty-eight billion, four hundred seventy-three million, nine hundred seventy-five thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •