Base | Representation |
---|---|
bin | 1001000110101010010000… |
… | …11100111010100000000111 |
3 | 2121212220021021022212011111 |
4 | 10203111020130322200013 |
5 | 10111002034333341423 |
6 | 110325030540545451 |
7 | 4134254463063424 |
oct | 443251034724007 |
9 | 77786237285144 |
10 | 20020058105863 |
11 | 6419505973932 |
12 | 22b4030b52287 |
13 | b22b63a2442a |
14 | 4d2d9414ad4b |
15 | 24ab7ac7d60d |
hex | 12354873a807 |
20020058105863 has 4 divisors (see below), whose sum is σ = 20508352206048. Its totient is φ = 19531764005680.
The previous prime is 20020058105857. The next prime is 20020058105911. The reversal of 20020058105863 is 36850185002002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20020058105863 - 225 = 20020024551431 is a prime.
It is a super-2 number, since 2×200200581058632 (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 (20020058105963) 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 3 ways as a sum of consecutive naturals, for example, 244147050031 + ... + 244147050112.
It is an arithmetic number, because the mean of its divisors is an integer number (5127088051512).
Almost surely, 220020058105863 is an apocalyptic number.
20020058105863 is a deficient number, since it is larger than the sum of its proper divisors (488294100185).
20020058105863 is an equidigital number, since it uses as much as digits as its factorization.
20020058105863 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488294100184.
The product of its (nonzero) digits is 115200, while the sum is 40.
The spelling of 20020058105863 in words is "twenty trillion, twenty billion, fifty-eight million, one hundred five thousand, eight hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •