Base | Representation |
---|---|
bin | 11111000001101100010… |
… | …10000100110010001111 |
3 | 10202220200120220112110100 |
4 | 33200312022010302033 |
5 | 114431242442000421 |
6 | 2133424052142143 |
7 | 140006654511165 |
oct | 17406612046217 |
9 | 3686616815410 |
10 | 1066060500111 |
11 | 3811283a6432 |
12 | 152739607953 |
13 | 796b54b5269 |
14 | 39851b77235 |
15 | 1cae60a2c26 |
hex | f836284c8f |
1066060500111 has 12 divisors (see below), whose sum is σ = 1630445470992. Its totient is φ = 668900705856.
The previous prime is 1066060500061. The next prime is 1066060500143. The reversal of 1066060500111 is 1110050606601.
1066060500111 is a `hidden beast` number, since 1 + 0 + 6 + 606 + 0 + 50 + 0 + 1 + 1 + 1 = 666.
It is not a de Polignac number, because 1066060500111 - 26 = 1066060500047 is a prime.
It is a super-2 number, since 2×10660605001112 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1066060550111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3483857691 + ... + 3483857996.
It is an arithmetic number, because the mean of its divisors is an integer number (135870455916).
Almost surely, 21066060500111 is an apocalyptic number.
1066060500111 is a deficient number, since it is larger than the sum of its proper divisors (564384970881).
1066060500111 is a wasteful number, since it uses less digits than its factorization.
1066060500111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6967715710 (or 6967715707 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
The spelling of 1066060500111 in words is "one trillion, sixty-six billion, sixty million, five hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •