Base | Representation |
---|---|
bin | 11110000010110001110011… |
… | …10000010100101001101001 |
3 | 22122220212021222221210200011 |
4 | 33001120321300110221221 |
5 | 32124411441403302011 |
6 | 352302212324211521 |
7 | 16626056634442132 |
oct | 1701307160245151 |
9 | 278825258853604 |
10 | 66066155915881 |
11 | 1a061554745300 |
12 | 74b0091b39ba1 |
13 | 2ab301cb24a34 |
14 | 12458947b2c89 |
15 | 7987eb923621 |
hex | 3c1639c14a69 |
66066155915881 has 9 divisors (see below), whose sum is σ = 72618269654973. Its totient is φ = 60060060460620.
The previous prime is 66066155915777. The next prime is 66066155915899. The reversal of 66066155915881 is 18851955166066.
The square root of 66066155915881 is 8128109.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 66066155915881 - 235 = 66031796177513 is a prime.
It is a super-2 number, since 2×660661559158812 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (66066155975881) 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, 89039740 + ... + 89778658.
Almost surely, 266066155915881 is an apocalyptic number.
66066155915881 is the 8128109-th square number.
66066155915881 is the 4064055-th centered octagonal number.
It is an amenable number.
66066155915881 is a deficient number, since it is larger than the sum of its proper divisors (6552113739092).
66066155915881 is an frugal number, since it uses more digits than its factorization.
66066155915881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1477860 (or 738930 counting only the distinct ones).
The product of its (nonzero) digits is 93312000, while the sum is 67.
The spelling of 66066155915881 in words is "sixty-six trillion, sixty-six billion, one hundred fifty-five million, nine hundred fifteen thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •