Base | Representation |
---|---|
bin | 111110001001011011… |
… | …100001010011110000 |
3 | 20101020112122111202000 |
4 | 332021123201103300 |
5 | 2043130412433402 |
6 | 50353323454000 |
7 | 4551431234622 |
oct | 761133412360 |
9 | 211215574660 |
10 | 66730202352 |
11 | 26333506770 |
12 | 10b23987300 |
13 | 63a5bab448 |
14 | 333065cc12 |
15 | 1b08526c1c |
hex | f896e14f0 |
66730202352 has 160 divisors (see below), whose sum is σ = 210286421760. Its totient is φ = 20092250880.
The previous prime is 66730202327. The next prime is 66730202387. The reversal of 66730202352 is 25320203766.
It is a happy number.
66730202352 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 701343 + ... + 790785.
It is an arithmetic number, because the mean of its divisors is an integer number (1314290136).
Almost surely, 266730202352 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 66730202352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (105143210880).
66730202352 is an abundant number, since it is smaller than the sum of its proper divisors (143556219408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66730202352 is a wasteful number, since it uses less digits than its factorization.
66730202352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89628 (or 89616 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 36.
The spelling of 66730202352 in words is "sixty-six billion, seven hundred thirty million, two hundred two thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •