Base | Representation |
---|---|
bin | 11110000001110110011001… |
… | …01010111010101001101011 |
3 | 22122210210222012001202112200 |
4 | 33000323030222322221223 |
5 | 32123401131304323201 |
6 | 352235415401511243 |
7 | 16623550355304324 |
oct | 1700731452725153 |
9 | 278723865052480 |
10 | 66034261011051 |
11 | 1a049a77916223 |
12 | 74a5a704a2523 |
13 | 2ab0008cc1298 |
14 | 124410a82944b |
15 | 797a81796386 |
hex | 3c0eccabaa6b |
66034261011051 has 12 divisors (see below), whose sum is σ = 95390063513160. Its totient is φ = 44019498188160.
The previous prime is 66034261010929. The next prime is 66034261011079. The reversal of 66034261011051 is 15011016243066.
66034261011051 is a `hidden beast` number, since 6 + 6 + 0 + 34 + 2 + 610 + 1 + 1 + 0 + 5 + 1 = 666.
It is not a de Polignac number, because 66034261011051 - 29 = 66034261010539 is a prime.
It is a super-2 number, since 2×660342610110512 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 66034261010997 and 66034261011015.
It is not an unprimeable number, because it can be changed into a prime (66034261011091) 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, 278415366 + ... + 278652443.
It is an arithmetic number, because the mean of its divisors is an integer number (7949171959430).
Almost surely, 266034261011051 is an apocalyptic number.
66034261011051 is a deficient number, since it is larger than the sum of its proper divisors (29355802502109).
66034261011051 is a wasteful number, since it uses less digits than its factorization.
66034261011051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 557080986 (or 557080983 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The spelling of 66034261011051 in words is "sixty-six trillion, thirty-four billion, two hundred sixty-one million, eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •