Base | Representation |
---|---|
bin | 111101100101101100… |
… | …110010111100110001 |
3 | 20022200202200020110111 |
4 | 331211230302330301 |
5 | 2040413433020111 |
6 | 50214031301321 |
7 | 4530532053100 |
oct | 754554627461 |
9 | 208622606414 |
10 | 66130751281 |
11 | 260560a3261 |
12 | 1099707a841 |
13 | 630b94567a |
14 | 32b4bba037 |
15 | 1ac0ab6a21 |
hex | f65b32f31 |
66130751281 has 27 divisors (see below), whose sum is σ = 81756780417. Its totient is φ = 53324490240.
The previous prime is 66130751233. The next prime is 66130751299. The reversal of 66130751281 is 18215703166.
It is a happy number.
The square root of 66130751281 is 257159.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 11179890225 + 54950861056 = 105735^2 + 234416^2 .
It is not a de Polignac number, because 66130751281 - 225 = 66097196849 is a prime.
It is a super-2 number, since 2×661307512812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (66130751381) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 30600841 + ... + 30603001.
Almost surely, 266130751281 is an apocalyptic number.
66130751281 is the 257159-th square number.
66130751281 is the 128580-th centered octagonal number.
It is an amenable number.
66130751281 is a deficient number, since it is larger than the sum of its proper divisors (15626029136).
66130751281 is an frugal number, since it uses more digits than its factorization.
66130751281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4370 (or 2185 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 40.
The spelling of 66130751281 in words is "sixty-six billion, one hundred thirty million, seven hundred fifty-one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •