Base | Representation |
---|---|
bin | 100101110101011101111111… |
… | …101011101010110111011011 |
3 | 210211011212210200021001100221 |
4 | 211311131333223222313123 |
5 | 133302312404341300011 |
6 | 1345524015011340511 |
7 | 50023103113241566 |
oct | 4565357753526733 |
9 | 724155720231327 |
10 | 166402060103131 |
11 | 49025798920aa6 |
12 | 167b5a012b1737 |
13 | 71b0854421798 |
14 | 2d13c8cd5d4dd |
15 | 14387759d9971 |
hex | 97577faeaddb |
166402060103131 has 4 divisors (see below), whose sum is σ = 173636932281552. Its totient is φ = 159167187924712.
The previous prime is 166402060103093. The next prime is 166402060103183. The reversal of 166402060103131 is 131301060204661.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 166402060103131 - 211 = 166402060101083 is a prime.
It is a super-2 number, since 2×1664020601031312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (166402060103731) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3617436089176 + ... + 3617436089221.
It is an arithmetic number, because the mean of its divisors is an integer number (43409233070388).
Almost surely, 2166402060103131 is an apocalyptic number.
166402060103131 is a deficient number, since it is larger than the sum of its proper divisors (7234872178421).
166402060103131 is an equidigital number, since it uses as much as digits as its factorization.
166402060103131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7234872178420.
The product of its (nonzero) digits is 15552, while the sum is 34.
The spelling of 166402060103131 in words is "one hundred sixty-six trillion, four hundred two billion, sixty million, one hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •