Base | Representation |
---|---|
bin | 111101100001001011… |
… | …111000101101100100 |
3 | 20022111111011110011222 |
4 | 331201023320231210 |
5 | 2040240040442033 |
6 | 50202324115512 |
7 | 4525622236304 |
oct | 754113705544 |
9 | 208444143158 |
10 | 66055015268 |
11 | 26017374710 |
12 | 10975835b98 |
13 | 62c9049068 |
14 | 32a8b03604 |
15 | 1ab9106598 |
hex | f612f8b64 |
66055015268 has 12 divisors (see below), whose sum is σ = 126105029232. Its totient is φ = 30025006920.
The previous prime is 66055015267. The next prime is 66055015289. The reversal of 66055015268 is 86251055066.
It is a super-3 number, since 3×660550152683 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (44), and also a Moran number because the ratio is a prime number: 1501250347 = 66055015268 / (6 + 6 + 0 + 5 + 5 + 0 + 1 + 5 + 2 + 6 + 8).
It is not an unprimeable number, because it can be changed into a prime (66055015267) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 750625130 + ... + 750625217.
It is an arithmetic number, because the mean of its divisors is an integer number (10508752436).
Almost surely, 266055015268 is an apocalyptic number.
It is an amenable number.
66055015268 is a deficient number, since it is larger than the sum of its proper divisors (60050013964).
66055015268 is a wasteful number, since it uses less digits than its factorization.
66055015268 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1501250362 (or 1501250360 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 44.
The spelling of 66055015268 in words is "sixty-six billion, fifty-five million, fifteen thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •