Base | Representation |
---|---|
bin | 100101110101110011101110… |
… | …111111010000001111100000 |
3 | 210211021010001102210202201221 |
4 | 211311303232333100033200 |
5 | 133303203211000010131 |
6 | 1345542435132504424 |
7 | 50024560421102305 |
oct | 4565635677201740 |
9 | 724233042722657 |
10 | 166425402344416 |
11 | 49034686a163a6 |
12 | 167ba43661b114 |
13 | 71b2b0437b487 |
14 | 2d150650990ac |
15 | 143918ed9e411 |
hex | 975ceefd03e0 |
166425402344416 has 48 divisors (see below), whose sum is σ = 334625119847424. Its totient is φ = 81441285476224.
The previous prime is 166425402344401. The next prime is 166425402344423. The reversal of 166425402344416 is 614443204524661.
166425402344416 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 141305421 + ... + 142478323.
It is an arithmetic number, because the mean of its divisors is an integer number (6971356663488).
Almost surely, 2166425402344416 is an apocalyptic number.
166425402344416 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
166425402344416 is an abundant number, since it is smaller than the sum of its proper divisors (168199717503008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166425402344416 is a wasteful number, since it uses less digits than its factorization.
166425402344416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1267303 (or 1267295 counting only the distinct ones).
The product of its (nonzero) digits is 13271040, while the sum is 52.
The spelling of 166425402344416 in words is "one hundred sixty-six trillion, four hundred twenty-five billion, four hundred two million, three hundred forty-four thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •