Base | Representation |
---|---|
bin | 111110011001010011… |
… | …111000000000000000 |
3 | 20101221002222121201000 |
4 | 332121103320000000 |
5 | 2044202114233400 |
6 | 50440002212000 |
7 | 4561144663251 |
oct | 763123700000 |
9 | 211832877630 |
10 | 66996633600 |
11 | 2645a942486 |
12 | 10b99054000 |
13 | 6419154a80 |
14 | 3357bb4b28 |
15 | 1b21b04600 |
hex | f994f8000 |
66996633600 has 768 divisors, whose sum is σ = 266218898400. Its totient is φ = 16420700160.
The previous prime is 66996633593. The next prime is 66996633601. The reversal of 66996633600 is 633669966.
It is a tau number, because it is divible by the number of its divisors (768).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66996633601) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 287539084 + ... + 287539316.
Almost surely, 266996633600 is an apocalyptic number.
66996633600 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 66996633600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133109449200).
66996633600 is an abundant number, since it is smaller than the sum of its proper divisors (199222264800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66996633600 is a wasteful number, since it uses less digits than its factorization.
66996633600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 295 (or 256 counting only the distinct ones).
The product of its (nonzero) digits is 5668704, while the sum is 54.
The spelling of 66996633600 in words is "sixty-six billion, nine hundred ninety-six million, six hundred thirty-three thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •