Base | Representation |
---|---|
bin | 1001000110101010001100… |
… | …01011100011010111001001 |
3 | 2121212220011121121220000200 |
4 | 10203111012023203113021 |
5 | 10111002000110001301 |
6 | 110325023100122413 |
7 | 4134253521145254 |
oct | 443250613432711 |
9 | 77786147556020 |
10 | 20020020000201 |
11 | 6419496407551 |
12 | 22b4020236409 |
13 | b22b58b71bc0 |
14 | 4d2d8d06c09b |
15 | 24ab77752c86 |
hex | 1235462e35c9 |
20020020000201 has 48 divisors (see below), whose sum is σ = 31187466906960. Its totient is φ = 12302138580480.
The previous prime is 20020020000191. The next prime is 20020020000229. The reversal of 20020020000201 is 10200002002002.
It can be written as a sum of positive squares in 8 ways, for example, as 807884582976 + 19212135417225 = 898824^2 + 4383165^2 .
It is not a de Polignac number, because 20020020000201 - 225 = 20019986445769 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (20020020000241) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 229593831 + ... + 229681011.
It is an arithmetic number, because the mean of its divisors is an integer number (649738893895).
Almost surely, 220020020000201 is an apocalyptic number.
It is an amenable number.
20020020000201 is a deficient number, since it is larger than the sum of its proper divisors (11167446906759).
20020020000201 is a wasteful number, since it uses less digits than its factorization.
20020020000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90026 (or 90023 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 9.
Adding to 20020020000201 its reverse (10200002002002), we get a palindrome (30220022002203).
The spelling of 20020020000201 in words is "twenty trillion, twenty billion, twenty million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •