Base | Representation |
---|---|
bin | 110111111101001110… |
… | …1000000000000001101 |
3 | 102111011120120110111011 |
4 | 1233322131000000031 |
5 | 3432100000220211 |
6 | 131111542525221 |
7 | 11452553226001 |
oct | 1577235000015 |
9 | 374146513434 |
10 | 120166023181 |
11 | 46a64650866 |
12 | 1b357436811 |
13 | b440706539 |
14 | 5b5d402701 |
15 | 31d484c921 |
hex | 1bfa74000d |
120166023181 has 2 divisors, whose sum is σ = 120166023182. Its totient is φ = 120166023180.
The previous prime is 120166023121. The next prime is 120166023259. The reversal of 120166023181 is 181320661021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 117986067081 + 2179956100 = 343491^2 + 46690^2 .
It is an emirp because it is prime and its reverse (181320661021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 120166023181 - 231 = 118018539533 is a prime.
It is a super-2 number, since 2×1201660231812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120166023121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60083011590 + 60083011591.
It is an arithmetic number, because the mean of its divisors is an integer number (60083011591).
Almost surely, 2120166023181 is an apocalyptic number.
It is an amenable number.
120166023181 is a deficient number, since it is larger than the sum of its proper divisors (1).
120166023181 is an equidigital number, since it uses as much as digits as its factorization.
120166023181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 31.
The spelling of 120166023181 in words is "one hundred twenty billion, one hundred sixty-six million, twenty-three thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •