Base | Representation |
---|---|
bin | 111100111110001101… |
… | …110000101010000000 |
3 | 20020222121011102122000 |
4 | 330332031300222000 |
5 | 2033034341212000 |
6 | 50024204544000 |
7 | 4505236254651 |
oct | 747615605200 |
9 | 206877142560 |
10 | 65468304000 |
11 | 25846172870 |
12 | 10831252000 |
13 | 6234623c28 |
14 | 3250c19528 |
15 | 1a82861000 |
hex | f3e370a80 |
65468304000 has 1024 divisors, whose sum is σ = 274959360000. Its totient is φ = 15155712000.
The previous prime is 65468303947. The next prime is 65468304029. The reversal of 65468304000 is 40386456.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 109295701 + ... + 109296299.
It is an arithmetic number, because the mean of its divisors is an integer number (268515000).
Almost surely, 265468304000 is an apocalyptic number.
65468304000 is a gapful number since it is divisible by the number (60) 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 65468304000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137479680000).
65468304000 is an abundant number, since it is smaller than the sum of its proper divisors (209491056000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65468304000 is a wasteful number, since it uses less digits than its factorization.
65468304000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 671 (or 643 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 36.
The spelling of 65468304000 in words is "sixty-five billion, four hundred sixty-eight million, three hundred four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •