Base | Representation |
---|---|
bin | 11111000001101100011… |
… | …10100001001100011010 |
3 | 10202220200200002201110020 |
4 | 33200312032201030122 |
5 | 114431243241240200 |
6 | 2133424133131310 |
7 | 140010000432414 |
oct | 17406616411432 |
9 | 3686620081406 |
10 | 1066061665050 |
11 | 381129021698 |
12 | 152739a89b36 |
13 | 796b5802585 |
14 | 39851d9b9b4 |
15 | 1cae6232ea0 |
hex | f8363a131a |
1066061665050 has 48 divisors (see below), whose sum is σ = 2653175200800. Its totient is φ = 283278565440.
The previous prime is 1066061665007. The next prime is 1066061665111. The reversal of 1066061665050 is 505661606601.
It is a super-2 number, since 2×10660616650502 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1066061664993 and 1066061665011.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 12514225 + ... + 12599124.
It is an arithmetic number, because the mean of its divisors is an integer number (55274483350).
Almost surely, 21066061665050 is an apocalyptic number.
1066061665050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1066061665050 is an abundant number, since it is smaller than the sum of its proper divisors (1587113535750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1066061665050 is a wasteful number, since it uses less digits than its factorization.
1066061665050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25113647 (or 25113642 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 42.
The spelling of 1066061665050 in words is "one trillion, sixty-six billion, sixty-one million, six hundred sixty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •