Base | Representation |
---|---|
bin | 111111101111100001… |
… | …000100000100000000 |
3 | 20112122220110011101021 |
4 | 333233201010010000 |
5 | 2110132342301311 |
6 | 51235305315224 |
7 | 4642036214134 |
oct | 775741040400 |
9 | 215586404337 |
10 | 68442931456 |
11 | 27032283469 |
12 | 11321495b14 |
13 | 65b9993813 |
14 | 3453cd93c4 |
15 | 1ba8a92171 |
hex | fef844100 |
68442931456 has 81 divisors (see below), whose sum is σ = 138989859421. Its totient is φ = 33637538816.
The previous prime is 68442931451. The next prime is 68442931463. The reversal of 68442931456 is 65413924486.
The square root of 68442931456 is 261616.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 67060281600 + 1382649856 = 258960^2 + 37184^2 .
It is a Duffinian number.
Its product of digits (4976640) is a multiple of the sum of its prime factors (576).
It is not an unprimeable number, because it can be changed into a prime (68442931451) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 347425950 + ... + 347426146.
Almost surely, 268442931456 is an apocalyptic number.
68442931456 is the 261616-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 68442931456
68442931456 is an abundant number, since it is smaller than the sum of its proper divisors (70546927965).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68442931456 is an frugal number, since it uses more digits than its factorization.
68442931456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576 (or 282 counting only the distinct ones).
The product of its digits is 4976640, while the sum is 52.
The spelling of 68442931456 in words is "sixty-eight billion, four hundred forty-two million, nine hundred thirty-one thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •