Base | Representation |
---|---|
bin | 100101101111111010100001… |
… | …011110000000100011110111 |
3 | 210202211101121101010121212121 |
4 | 211233322201132000203313 |
5 | 133230034211430423400 |
6 | 1345032412440100411 |
7 | 46653401441214361 |
oct | 4557724136004367 |
9 | 722741541117777 |
10 | 166020374857975 |
11 | 48998933513030 |
12 | 16753a3b764707 |
13 | 71838672a96b1 |
14 | 2cdd60131bd31 |
15 | 142d886e2021a |
hex | 96fea17808f7 |
166020374857975 has 48 divisors (see below), whose sum is σ = 228456889073280. Its totient is φ = 118661278320000.
The previous prime is 166020374857973. The next prime is 166020374858017. The reversal of 166020374857975 is 579758473020661.
It is not a de Polignac number, because 166020374857975 - 21 = 166020374857973 is a prime.
It is a super-2 number, since 2×1660203748579752 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166020374857973) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 15417696 + ... + 23869354.
It is an arithmetic number, because the mean of its divisors is an integer number (4759518522360).
It is a 1-persistent number, because it is pandigital, but 2⋅166020374857975 = 332040749715950 is not.
Almost surely, 2166020374857975 is an apocalyptic number.
166020374857975 is a deficient number, since it is larger than the sum of its proper divisors (62436514215305).
166020374857975 is a wasteful number, since it uses less digits than its factorization.
166020374857975 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8452912 (or 8452907 counting only the distinct ones).
The product of its (nonzero) digits is 533433600, while the sum is 70.
The spelling of 166020374857975 in words is "one hundred sixty-six trillion, twenty billion, three hundred seventy-four million, eight hundred fifty-seven thousand, nine hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •