Base | Representation |
---|---|
bin | 111111100001111001… |
… | …100011010110000000 |
3 | 20112001222120010012110 |
4 | 333201321203112000 |
5 | 2104200401020031 |
6 | 51200504455320 |
7 | 4633263266610 |
oct | 774171432600 |
9 | 215058503173 |
10 | 68214470016 |
11 | 26a25320a60 |
12 | 11278a7a540 |
13 | 6581552934 |
14 | 3431828a40 |
15 | 1b939b4c46 |
hex | fe1e63580 |
68214470016 has 1024 divisors, whose sum is σ = 253808640000. Its totient is φ = 15699640320.
The previous prime is 68214469957. The next prime is 68214470033. The reversal of 68214470016 is 61007441286.
68214470016 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 863474265 + ... + 863474343.
It is an arithmetic number, because the mean of its divisors is an integer number (247860000).
Almost surely, 268214470016 is an apocalyptic number.
68214470016 is a gapful number since it is divisible by the number (66) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 68214470016, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126904320000).
68214470016 is an abundant number, since it is smaller than the sum of its proper divisors (185594169984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68214470016 is a wasteful number, since it uses less digits than its factorization.
68214470016 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 215 (or 203 counting only the distinct ones).
The product of its (nonzero) digits is 64512, while the sum is 39.
The spelling of 68214470016 in words is "sixty-eight billion, two hundred fourteen million, four hundred seventy thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •