Base | Representation |
---|---|
bin | 11110010111001010101111… |
… | …11000110000111000100001 |
3 | 22202101211121222121100212100 |
4 | 33023211113320300320201 |
5 | 32222401241211130101 |
6 | 354000114544321013 |
7 | 20030511041406606 |
oct | 1713452770607041 |
9 | 282354558540770 |
10 | 66766741114401 |
11 | 1a301685832239 |
12 | 75a3a12613169 |
13 | 2b340cc5a7393 |
14 | 126b7556ca6ad |
15 | 7abb52072e86 |
hex | 3cb957e30e21 |
66766741114401 has 12 divisors (see below), whose sum is σ = 97524453314340. Its totient is φ = 44011035340800.
The previous prime is 66766741114273. The next prime is 66766741114439. The reversal of 66766741114401 is 10441114766766.
66766741114401 is a `hidden beast` number, since 6 + 67 + 6 + 67 + 4 + 1 + 114 + 401 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 43671267763776 + 23095473350625 = 6608424^2 + 4805775^2 .
It is not a de Polignac number, because 66766741114401 - 27 = 66766741114273 is a prime.
It is not an unprimeable number, because it can be changed into a prime (66766741114481) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 41677116000 + ... + 41677117601.
It is an arithmetic number, because the mean of its divisors is an integer number (8127037776195).
Almost surely, 266766741114401 is an apocalyptic number.
It is an amenable number.
66766741114401 is a deficient number, since it is larger than the sum of its proper divisors (30757712199939).
66766741114401 is a wasteful number, since it uses less digits than its factorization.
66766741114401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83354233696 (or 83354233693 counting only the distinct ones).
The product of its (nonzero) digits is 4064256, while the sum is 54.
The spelling of 66766741114401 in words is "sixty-six trillion, seven hundred sixty-six billion, seven hundred forty-one million, one hundred fourteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •