Base | Representation |
---|---|
bin | 1001001001100000000101… |
… | …00110011100101000101111 |
3 | 2122020020020001011121010000 |
4 | 10210300002212130220233 |
5 | 10114101442113311123 |
6 | 110441532532115343 |
7 | 4144311425230335 |
oct | 444600246345057 |
9 | 78206201147100 |
10 | 20117670447663 |
11 | 6456946556a98 |
12 | 230ab33165b53 |
13 | b2c11b979969 |
14 | 4d79b4041b55 |
15 | 24d49057db43 |
hex | 124c0299ca2f |
20117670447663 has 20 divisors (see below), whose sum is σ = 30056768291088. Its totient is φ = 13409796235680.
The previous prime is 20117670447631. The next prime is 20117670447671. The reversal of 20117670447663 is 36674407671102.
It is a happy number.
20117670447663 is a `hidden beast` number, since 2 + 0 + 1 + 1 + 76 + 70 + 447 + 6 + 63 = 666.
It is not a de Polignac number, because 20117670447663 - 25 = 20117670447631 is a prime.
It is a super-3 number, since 3×201176704476633 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20117670440663) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 17819931 + ... + 18915212.
Almost surely, 220117670447663 is an apocalyptic number.
20117670447663 is a deficient number, since it is larger than the sum of its proper divisors (9939097843425).
20117670447663 is an equidigital number, since it uses as much as digits as its factorization.
20117670447663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36741916 (or 36741907 counting only the distinct ones).
The product of its (nonzero) digits is 7112448, while the sum is 54.
The spelling of 20117670447663 in words is "twenty trillion, one hundred seventeen billion, six hundred seventy million, four hundred forty-seven thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •