Base | Representation |
---|---|
bin | 111111110010011000… |
… | …101101001110100000 |
3 | 20112210021000222100210 |
4 | 333302120231032200 |
5 | 2110232203304131 |
6 | 51244145214120 |
7 | 4643162336604 |
oct | 776230551640 |
9 | 215707028323 |
10 | 68491072416 |
11 | 27057474488 |
12 | 11335631340 |
13 | 65c694a9b0 |
14 | 345a46b504 |
15 | 1bace01146 |
hex | ff262d3a0 |
68491072416 has 96 divisors (see below), whose sum is σ = 194040620928. Its totient is φ = 21028285440.
The previous prime is 68491072409. The next prime is 68491072459. The reversal of 68491072416 is 61427019486.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 515805 + ... + 634851.
It is an arithmetic number, because the mean of its divisors is an integer number (2021256468).
Almost surely, 268491072416 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 68491072416, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (97020310464).
68491072416 is an abundant number, since it is smaller than the sum of its proper divisors (125549548512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68491072416 is a wasteful number, since it uses less digits than its factorization.
68491072416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119534 (or 119526 counting only the distinct ones).
The product of its (nonzero) digits is 580608, while the sum is 48.
The spelling of 68491072416 in words is "sixty-eight billion, four hundred ninety-one million, seventy-two thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •