Base | Representation |
---|---|
bin | 111101111101100100… |
… | …010100101001000000 |
3 | 20100201200011021202010 |
4 | 331331210110221000 |
5 | 2042223440330133 |
6 | 50321454052520 |
7 | 4543463504022 |
oct | 757544245100 |
9 | 210650137663 |
10 | 66531183168 |
11 | 262411336aa |
12 | 10a891aa140 |
13 | 63738a8708 |
14 | 3312054012 |
15 | 1ae5d13263 |
hex | f7d914a40 |
66531183168 has 112 divisors (see below), whose sum is σ = 177790961664. Its totient is φ = 21956014080.
The previous prime is 66531183167. The next prime is 66531183181. The reversal of 66531183168 is 86138113566.
It is a super-3 number, since 3×665311831683 (a number of 33 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (66531183167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12701446 + ... + 12706682.
Almost surely, 266531183168 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 66531183168, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (88895480832).
66531183168 is an abundant number, since it is smaller than the sum of its proper divisors (111259778496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66531183168 is a wasteful number, since it uses less digits than its factorization.
66531183168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5900 (or 5890 counting only the distinct ones).
The product of its digits is 622080, while the sum is 48.
The spelling of 66531183168 in words is "sixty-six billion, five hundred thirty-one million, one hundred eighty-three thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •