Base | Representation |
---|---|
bin | 111101100110111111… |
… | …110100100110000000 |
3 | 20022202021122000000000 |
4 | 331212333310212000 |
5 | 2040440021002333 |
6 | 50220130000000 |
7 | 4531215052020 |
oct | 754677644600 |
9 | 208667560000 |
10 | 66152515968 |
11 | 26067409400 |
12 | 109a2416000 |
13 | 63132c6096 |
14 | 32b7a43a80 |
15 | 1ac2965713 |
hex | f66ff4980 |
66152515968 has 960 divisors, whose sum is σ = 256334453760. Its totient is φ = 16628198400.
The previous prime is 66152515927. The next prime is 66152516021. The reversal of 66152515968 is 86951525166.
66152515968 is a `hidden beast` number, since 6 + 6 + 1 + 525 + 1 + 59 + 68 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
Its product of digits (3888000) is a multiple of the sum of its prime divisors (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 2133952113 + ... + 2133952143.
It is an arithmetic number, because the mean of its divisors is an integer number (267015056).
Almost surely, 266152515968 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 66152515968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128167226880).
66152515968 is an abundant number, since it is smaller than the sum of its proper divisors (190181937792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66152515968 is an frugal number, since it uses more digits than its factorization.
66152515968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101 (or 54 counting only the distinct ones).
The product of its digits is 3888000, while the sum is 54.
The spelling of 66152515968 in words is "sixty-six billion, one hundred fifty-two million, five hundred fifteen thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •