Base | Representation |
---|---|
bin | 1001001001011101001100… |
… | …10100111001001111011001 |
3 | 2122020002020011010200212121 |
4 | 10210232212110321033121 |
5 | 10114040304304423421 |
6 | 110441115150541241 |
7 | 4144225156445653 |
oct | 444564624711731 |
9 | 78202204120777 |
10 | 20116122342361 |
11 | 64562216aa621 |
12 | 230a780807821 |
13 | b2bc33013816 |
14 | 4d78a85b96d3 |
15 | 24d3ee6d0d41 |
hex | 124ba65393d9 |
20116122342361 has 4 divisors (see below), whose sum is σ = 20126873879424. Its totient is φ = 20105370805300.
The previous prime is 20116122342347. The next prime is 20116122342391. The reversal of 20116122342361 is 16324322161102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20116122342361 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20116122342311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5375765725 + ... + 5375769466.
It is an arithmetic number, because the mean of its divisors is an integer number (5031718469856).
Almost surely, 220116122342361 is an apocalyptic number.
It is an amenable number.
20116122342361 is a deficient number, since it is larger than the sum of its proper divisors (10751537063).
20116122342361 is a wasteful number, since it uses less digits than its factorization.
20116122342361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10751537062.
The product of its (nonzero) digits is 20736, while the sum is 34.
The spelling of 20116122342361 in words is "twenty trillion, one hundred sixteen billion, one hundred twenty-two million, three hundred forty-two thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •