Base | Representation |
---|---|
bin | 11111000001101001000… |
… | …01110011010101110001 |
3 | 10202220121200110210200001 |
4 | 33200310201303111301 |
5 | 114431213442300211 |
6 | 2133421234230001 |
7 | 140006203254031 |
oct | 17406441632561 |
9 | 3686550423601 |
10 | 1066033165681 |
11 | 381113a266a0 |
12 | 152730425301 |
13 | 796ac934643 |
14 | 3984c29d8c1 |
15 | 1cae39a3ac1 |
hex | f834873571 |
1066033165681 has 16 divisors (see below), whose sum is σ = 1166032324800. Its totient is φ = 966549760000.
The previous prime is 1066033165651. The next prime is 1066033165693. The reversal of 1066033165681 is 1865613306601.
1066033165681 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1066033165681 - 27 = 1066033165553 is a prime.
It is a super-2 number, since 2×10660331656812 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1066033165651) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18411705 + ... + 18469513.
It is an arithmetic number, because the mean of its divisors is an integer number (72877020300).
Almost surely, 21066033165681 is an apocalyptic number.
1066033165681 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1066033165681 is a deficient number, since it is larger than the sum of its proper divisors (99999159119).
1066033165681 is a wasteful number, since it uses less digits than its factorization.
1066033165681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62240.
The product of its (nonzero) digits is 466560, while the sum is 46.
The spelling of 1066033165681 in words is "one trillion, sixty-six billion, thirty-three million, one hundred sixty-five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •