Base | Representation |
---|---|
bin | 11101001000101000010101… |
… | …01110101100101000000000 |
3 | 22101211212020111220100121210 |
4 | 32210110022232230220000 |
5 | 31344143142013334000 |
6 | 344132310020450120 |
7 | 16331526620340000 |
oct | 1644241256545000 |
9 | 271755214810553 |
10 | 64068207168000 |
11 | 194611a0767602 |
12 | 7228a20b49940 |
13 | 29997b5541019 |
14 | 11b6cbc520000 |
15 | 761863a7e350 |
hex | 3a450abaca00 |
64068207168000 has 1600 divisors, whose sum is σ = 253870792800768. Its totient is φ = 14327736729600.
The previous prime is 64068207167989. The next prime is 64068207168023. The reversal of 64068207168000 is 86170286046.
It is a tau number, because it is divible by the number of its divisors (1600).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 21666622522 + ... + 21666625478.
Almost surely, 264068207168000 is an apocalyptic number.
64068207168000 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 64068207168000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126935396400384).
64068207168000 is an abundant number, since it is smaller than the sum of its proper divisors (189802585632768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64068207168000 is an frugal number, since it uses more digits than its factorization.
64068207168000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3068 (or 3021 counting only the distinct ones).
The product of its (nonzero) digits is 774144, while the sum is 48.
The spelling of 64068207168000 in words is "sixty-four trillion, sixty-eight billion, two hundred seven million, one hundred sixty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •