Base | Representation |
---|---|
bin | 1111110010111… |
… | …1001010110000 |
3 | 11121200000200220 |
4 | 3330233022300 |
5 | 113430102423 |
6 | 10324013040 |
7 | 1433100600 |
oct | 374571260 |
9 | 147600626 |
10 | 66253488 |
11 | 34442254 |
12 | 1a231180 |
13 | 10959462 |
14 | 8b28c00 |
15 | 5c3a9e3 |
hex | 3f2f2b0 |
66253488 has 120 divisors (see below), whose sum is σ = 210937392. Its totient is φ = 17805312.
The previous prime is 66253483. The next prime is 66253489. The reversal of 66253488 is 88435266.
It is a super-2 number, since 2×662534882 = 8779049344332288, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66253483) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 39156 + ... + 40812.
Almost surely, 266253488 is an apocalyptic number.
66253488 is a gapful number since it is divisible by the number (68) 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 66253488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (105468696).
66253488 is an abundant number, since it is smaller than the sum of its proper divisors (144683904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66253488 is a wasteful number, since it uses less digits than its factorization.
66253488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1699 (or 1686 counting only the distinct ones).
The product of its digits is 276480, while the sum is 42.
The square root of 66253488 is about 8139.6245613665. The cubic root of 66253488 is about 404.6407177964.
The spelling of 66253488 in words is "sixty-six million, two hundred fifty-three thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •