Base | Representation |
---|---|
bin | 111111010101110110… |
… | …101000000110100000 |
3 | 20111112220021200222200 |
4 | 333111312220012200 |
5 | 2103242132021410 |
6 | 51124445133200 |
7 | 4625260442616 |
oct | 772566500640 |
9 | 214486250880 |
10 | 68012376480 |
11 | 26931239104 |
12 | 1122125a200 |
13 | 654b714769 |
14 | 3412a5d6b6 |
15 | 1b80d953c0 |
hex | fd5da81a0 |
68012376480 has 144 divisors (see below), whose sum is σ = 237030603264. Its totient is φ = 17750730240.
The previous prime is 68012376473. The next prime is 68012376533. The reversal of 68012376480 is 8467321086.
68012376480 is a `hidden beast` number, since 6 + 80 + 1 + 23 + 76 + 480 = 666.
68012376480 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 434776 + ... + 570135.
It is an arithmetic number, because the mean of its divisors is an integer number (1646045856).
Almost surely, 268012376480 is an apocalyptic number.
68012376480 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
68012376480 is an abundant number, since it is smaller than the sum of its proper divisors (169018226784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68012376480 is a wasteful number, since it uses less digits than its factorization.
68012376480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1004979 (or 1004968 counting only the distinct ones).
The product of its (nonzero) digits is 387072, while the sum is 45.
The spelling of 68012376480 in words is "sixty-eight billion, twelve million, three hundred seventy-six thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •