Base | Representation |
---|---|
bin | 1001001010110100111110… |
… | …11010111001011010001101 |
3 | 2122101120212122020102220211 |
4 | 10211122133122321122031 |
5 | 10120323314241200121 |
6 | 110514511504042421 |
7 | 4150514105430253 |
oct | 445323732713215 |
9 | 78346778212824 |
10 | 20163251115661 |
11 | 6474206666545 |
12 | 2317934003411 |
13 | b33503c78324 |
14 | 4d9c998645d3 |
15 | 24e75be6bce1 |
hex | 12569f6b968d |
20163251115661 has 4 divisors (see below), whose sum is σ = 20190535624000. Its totient is φ = 20135966607324.
The previous prime is 20163251115647. The next prime is 20163251115703. The reversal of 20163251115661 is 16651115236102.
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 not a de Polignac number, because 20163251115661 - 211 = 20163251113613 is a prime.
It is a super-2 number, since 2×201632511156612 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20163251115611) 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, 13642253061 + ... + 13642254538.
It is an arithmetic number, because the mean of its divisors is an integer number (5047633906000).
Almost surely, 220163251115661 is an apocalyptic number.
It is an amenable number.
20163251115661 is a deficient number, since it is larger than the sum of its proper divisors (27284508339).
20163251115661 is an equidigital number, since it uses as much as digits as its factorization.
20163251115661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27284508338.
The product of its (nonzero) digits is 64800, while the sum is 40.
The spelling of 20163251115661 in words is "twenty trillion, one hundred sixty-three billion, two hundred fifty-one million, one hundred fifteen thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •