Base | Representation |
---|---|
bin | 11111000001101101000… |
… | …11101100100100100101 |
3 | 10202220201001112202212001 |
4 | 33200312203230210211 |
5 | 114431301201413202 |
6 | 2133424452125301 |
7 | 140010065554051 |
oct | 17406643544445 |
9 | 3686631482761 |
10 | 1066067216677 |
11 | 381131173711 |
12 | 15273b906831 |
13 | 796b69c7468 |
14 | 39852a04c61 |
15 | 1cae697cd87 |
hex | f8368ec925 |
1066067216677 has 8 divisors (see below), whose sum is σ = 1070796095712. Its totient is φ = 1061338623600.
The previous prime is 1066067216633. The next prime is 1066067216707. The reversal of 1066067216677 is 7766127606601.
1066067216677 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1066067216677 - 219 = 1066066692389 is a prime.
It is a super-2 number, since 2×10660672166772 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1066067216377) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11626902 + ... + 11718232.
It is an arithmetic number, because the mean of its divisors is an integer number (133849511964).
Almost surely, 21066067216677 is an apocalyptic number.
It is an amenable number.
1066067216677 is a deficient number, since it is larger than the sum of its proper divisors (4728879035).
1066067216677 is an equidigital number, since it uses as much as digits as its factorization.
1066067216677 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142979.
The product of its (nonzero) digits is 5334336, while the sum is 55.
The spelling of 1066067216677 in words is "one trillion, sixty-six billion, sixty-seven million, two hundred sixteen thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •