Base | Representation |
---|---|
bin | 11110111010111111011010… |
… | …00011110111010111000100 |
3 | 22220202111200222011201011121 |
4 | 33131133231003313113010 |
5 | 32403033043221220411 |
6 | 400341400202043324 |
7 | 20215444012354012 |
oct | 1735375503672704 |
9 | 286674628151147 |
10 | 67997604476356 |
11 | 1a73669303aa35 |
12 | 77624841a9544 |
13 | 2bc31ba093329 |
14 | 12b115cb9d8b2 |
15 | 7cdb91578571 |
hex | 3dd7ed0f75c4 |
67997604476356 has 27 divisors (see below), whose sum is σ = 119129672266983. Its totient is φ = 33960598214400.
The previous prime is 67997604476353. The next prime is 67997604476357. The reversal of 67997604476356 is 65367440679976.
The square root of 67997604476356 is 8246066.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 42845533922500 + 25152070553856 = 6545650^2 + 5015184^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (67997604476353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 19807048816 + ... + 19807052248.
Almost surely, 267997604476356 is an apocalyptic number.
67997604476356 is the 8246066-th square number.
It is an amenable number.
67997604476356 is a deficient number, since it is larger than the sum of its proper divisors (51132067790627).
67997604476356 is an frugal number, since it uses more digits than its factorization.
67997604476356 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9272 (or 4636 counting only the distinct ones).
The product of its (nonzero) digits is 8641624320, while the sum is 79.
The spelling of 67997604476356 in words is "sixty-seven trillion, nine hundred ninety-seven billion, six hundred four million, four hundred seventy-six thousand, three hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •