Base | Representation |
---|---|
bin | 111111000111110011… |
… | …011010001101011101 |
3 | 20110221110201122222000 |
4 | 333013303122031131 |
5 | 2102301310332000 |
6 | 51045224512513 |
7 | 4616366015610 |
oct | 770763321535 |
9 | 213843648860 |
10 | 67776652125 |
11 | 26820175996 |
12 | 1117631b739 |
13 | 651192cab0 |
14 | 33cd61c177 |
15 | 1b6a331000 |
hex | fc7cda35d |
67776652125 has 128 divisors (see below), whose sum is σ = 154230236160. Its totient is φ = 28600128000.
The previous prime is 67776652117. The next prime is 67776652169. The reversal of 67776652125 is 52125667776.
It is not a de Polignac number, because 67776652125 - 23 = 67776652117 is a prime.
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
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 127 ways as a sum of consecutive naturals, for example, 196785 + ... + 417465.
It is an arithmetic number, because the mean of its divisors is an integer number (1204923720).
Almost surely, 267776652125 is an apocalyptic number.
67776652125 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
67776652125 is an abundant number, since it is smaller than the sum of its proper divisors (86453584035).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67776652125 is a wasteful number, since it uses less digits than its factorization.
67776652125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220725 (or 220709 counting only the distinct ones).
The product of its digits is 7408800, while the sum is 54.
The spelling of 67776652125 in words is "sixty-seven billion, seven hundred seventy-six million, six hundred fifty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •