Base | Representation |
---|---|
bin | 111111010011110010… |
… | …001010100001010000 |
3 | 20111110110221112101002 |
4 | 333103302022201100 |
5 | 2103204234333204 |
6 | 51121205001132 |
7 | 4624356340142 |
oct | 772362124120 |
9 | 214413845332 |
10 | 67977652304 |
11 | 26913681341 |
12 | 112116b31a8 |
13 | 6544477403 |
14 | 340c1c0c92 |
15 | 1b7ccd691e |
hex | fd3c8a850 |
67977652304 has 20 divisors (see below), whose sum is σ = 136248312660. Its totient is φ = 32816797440.
The previous prime is 67977652229. The next prime is 67977652313. The reversal of 67977652304 is 40325677976.
It can be written as a sum of positive squares in 2 ways, for example, as 45176652304 + 22801000000 = 212548^2 + 151000^2 .
It is a super-2 number, since 2×679776523042 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 67977652304.
It is a congruent number.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 73251317 + ... + 73252244.
It is an arithmetic number, because the mean of its divisors is an integer number (6812415633).
Almost surely, 267977652304 is an apocalyptic number.
It is an amenable number.
67977652304 is an abundant number, since it is smaller than the sum of its proper divisors (68270660356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67977652304 is a wasteful number, since it uses less digits than its factorization.
67977652304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146503598 (or 146503592 counting only the distinct ones).
The product of its (nonzero) digits is 13335840, while the sum is 56.
The spelling of 67977652304 in words is "sixty-seven billion, nine hundred seventy-seven million, six hundred fifty-two thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •