Base | Representation |
---|---|
bin | 11111000001101100110… |
… | …10001010010000000000 |
3 | 10202220200212211202200000 |
4 | 33200312122022100000 |
5 | 114431300031414200 |
6 | 2133424322400000 |
7 | 140010035402556 |
oct | 17406632122000 |
9 | 3686625752600 |
10 | 1066064716800 |
11 | 38112a8164a6 |
12 | 15273ab00000 |
13 | 796b6330645 |
14 | 39852553bd6 |
15 | 1cae6637300 |
hex | f83668a400 |
1066064716800 has 792 divisors, whose sum is σ = 3977535525600. Its totient is φ = 282912030720.
The previous prime is 1066064716777. The next prime is 1066064716813. The reversal of 1066064716800 is 86174606601.
It is a super-2 number, since 2×10660647168002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 2544306991 + ... + 2544307409.
Almost surely, 21066064716800 is an apocalyptic number.
1066064716800 is a gapful number since it is divisible by the number (10) 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 1066064716800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1988767762800).
1066064716800 is an abundant number, since it is smaller than the sum of its proper divisors (2911470808800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1066064716800 is an equidigital number, since it uses as much as digits as its factorization.
1066064716800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 873 (or 838 counting only the distinct ones).
The product of its (nonzero) digits is 290304, while the sum is 45.
The spelling of 1066064716800 in words is "one trillion, sixty-six billion, sixty-four million, seven hundred sixteen thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •