Base | Representation |
---|---|
bin | 11111000010000101110… |
… | …10000000101010000111 |
3 | 10202221020111101101221111 |
4 | 33201002322000222013 |
5 | 114432212221031321 |
6 | 2133501212425451 |
7 | 140015162536603 |
oct | 17410272005207 |
9 | 3687214341844 |
10 | 1066274392711 |
11 | 381228108080 |
12 | 152799178287 |
13 | 7971a8c4b28 |
14 | 39872334503 |
15 | 1cb09c535e1 |
hex | f842e80a87 |
1066274392711 has 16 divisors (see below), whose sum is σ = 1172193314688. Its totient is φ = 961854285600.
The previous prime is 1066274392709. The next prime is 1066274392741. The reversal of 1066274392711 is 1172934726601.
It is a cyclic number.
It is not a de Polignac number, because 1066274392711 - 21 = 1066274392709 is a prime.
It is a super-2 number, since 2×10662743927112 (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 (1066274392741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20301961 + ... + 20354413.
It is an arithmetic number, because the mean of its divisors is an integer number (73262082168).
Almost surely, 21066274392711 is an apocalyptic number.
1066274392711 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1066274392711 is a deficient number, since it is larger than the sum of its proper divisors (105918921977).
1066274392711 is a wasteful number, since it uses less digits than its factorization.
1066274392711 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66702.
The product of its (nonzero) digits is 762048, while the sum is 49.
The spelling of 1066274392711 in words is "one trillion, sixty-six billion, two hundred seventy-four million, three hundred ninety-two thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •