Base | Representation |
---|---|
bin | 111101101101111000… |
… | …111010011101000100 |
3 | 20100001100012120212101 |
4 | 331231320322131010 |
5 | 2041204121123401 |
6 | 50235420201444 |
7 | 4534120641211 |
oct | 755570723504 |
9 | 210040176771 |
10 | 66268145476 |
11 | 26116705585 |
12 | 10a15099284 |
13 | 633124c900 |
14 | 32c9142b08 |
15 | 1accba6101 |
hex | f6de3a744 |
66268145476 has 27 divisors (see below), whose sum is σ = 125588859543. Its totient is φ = 30582208800.
The previous prime is 66268145473. The next prime is 66268145479. The reversal of 66268145476 is 67454186266.
It is a happy number.
The square root of 66268145476 is 257426.
It is a perfect power (a square), and thus also a powerful number.
It is an interprime number because it is at equal distance from previous prime (66268145473) and next prime (66268145479).
It can be written as a sum of positive squares in 4 ways, for example, as 2449260100 + 63818885376 = 49490^2 + 252624^2 .
It is a super-3 number, since 3×662681454763 (a number of 33 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (66268145473) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 6688126 + ... + 6698026.
Almost surely, 266268145476 is an apocalyptic number.
66268145476 is the 257426-th square number.
It is an amenable number.
66268145476 is a deficient number, since it is larger than the sum of its proper divisors (59320714067).
66268145476 is an frugal number, since it uses more digits than its factorization.
66268145476 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19832 (or 9916 counting only the distinct ones).
The product of its digits is 11612160, while the sum is 55.
The spelling of 66268145476 in words is "sixty-six billion, two hundred sixty-eight million, one hundred forty-five thousand, four hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •