Base | Representation |
---|---|
bin | 111101110101100110… |
… | …011101001111000010 |
3 | 20100101100122202010000 |
4 | 331311212131033002 |
5 | 2041440231244210 |
6 | 50300321220430 |
7 | 4540251435612 |
oct | 756546351702 |
9 | 210340582100 |
10 | 66397524930 |
11 | 26182743250 |
12 | 10a50491716 |
13 | 6351cabab9 |
14 | 32dc3c0a42 |
15 | 1ad9210ac0 |
hex | f7599d3c2 |
66397524930 has 240 divisors, whose sum is σ = 203616794304. Its totient is φ = 15395434560.
The previous prime is 66397524929. The next prime is 66397524931. The reversal of 66397524930 is 3942579366.
66397524930 is a `hidden beast` number, since 6 + 6 + 397 + 5 + 249 + 3 + 0 = 666.
It is an interprime number because it is at equal distance from previous prime (66397524929) and next prime (66397524931).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (66397524931) by changing a digit.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 4706347 + ... + 4720433.
Almost surely, 266397524930 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 66397524930, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (101808397152).
66397524930 is an abundant number, since it is smaller than the sum of its proper divisors (137219269374).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66397524930 is a wasteful number, since it uses less digits than its factorization.
66397524930 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14163 (or 14131 counting only the distinct ones).
The product of its (nonzero) digits is 7348320, while the sum is 54.
The spelling of 66397524930 in words is "sixty-six billion, three hundred ninety-seven million, five hundred twenty-four thousand, nine hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •