Base | Representation |
---|---|
bin | 11101010000011000001101… |
… | …00011111110011111001010 |
3 | 22102210022101201010200010010 |
4 | 32220030012203332133022 |
5 | 31413023400324033231 |
6 | 344454454341332350 |
7 | 16360003013424210 |
oct | 1650140643763712 |
9 | 272708351120103 |
10 | 64334425221066 |
11 | 1955409292a0a0 |
12 | 7270538a070b6 |
13 | 29b89305c1600 |
14 | 11c5b34c24cb0 |
15 | 7687455b2546 |
hex | 3a83068fe7ca |
64334425221066 has 384 divisors, whose sum is σ = 179584881242112. Its totient is φ = 14908458240000.
The previous prime is 64334425220987. The next prime is 64334425221151. The reversal of 64334425221066 is 66012252443346.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 436148046 + ... + 436295526.
It is an arithmetic number, because the mean of its divisors is an integer number (467668961568).
Almost surely, 264334425221066 is an apocalyptic number.
64334425221066 is a gapful number since it is divisible by the number (66) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 64334425221066, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (89792440621056).
64334425221066 is an abundant number, since it is smaller than the sum of its proper divisors (115250456021046).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64334425221066 is a wasteful number, since it uses less digits than its factorization.
64334425221066 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147718 (or 147705 counting only the distinct ones).
The product of its (nonzero) digits is 4976640, while the sum is 48.
The spelling of 64334425221066 in words is "sixty-four trillion, three hundred thirty-four billion, four hundred twenty-five million, two hundred twenty-one thousand, sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •