Base | Representation |
---|---|
bin | 100101110001011001110000… |
… | …011111100101010010111111 |
3 | 210210012011112212202002111002 |
4 | 211301121300133211102333 |
5 | 133233223122343331421 |
6 | 1345151403410120515 |
7 | 46663651460050250 |
oct | 4561316037452277 |
9 | 723164485662432 |
10 | 166122632402111 |
11 | 48a28238201490 |
12 | 1676b81958013b |
13 | 71903b2717968 |
14 | 2d04542118b27 |
15 | 143136e441b0b |
hex | 9716707e54bf |
166122632402111 has 16 divisors (see below), whose sum is σ = 207188139360768. Its totient is φ = 129399827032800.
The previous prime is 166122632402081. The next prime is 166122632402131. The reversal of 166122632402111 is 111204236221661.
It is a cyclic number.
It is not a de Polignac number, because 166122632402111 - 210 = 166122632401087 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166122632402131) 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, 386283980 + ... + 386713793.
It is an arithmetic number, because the mean of its divisors is an integer number (12949258710048).
Almost surely, 2166122632402111 is an apocalyptic number.
166122632402111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
166122632402111 is a deficient number, since it is larger than the sum of its proper divisors (41065506958657).
166122632402111 is a wasteful number, since it uses less digits than its factorization.
166122632402111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 773000582.
The product of its (nonzero) digits is 41472, while the sum is 38.
Adding to 166122632402111 its reverse (111204236221661), we get a palindrome (277326868623772).
The spelling of 166122632402111 in words is "one hundred sixty-six trillion, one hundred twenty-two billion, six hundred thirty-two million, four hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •