Base | Representation |
---|---|
bin | 1001001001010011101101… |
… | …10100000001101111110001 |
3 | 2122012121002021102120220112 |
4 | 10210221312310001233301 |
5 | 10113444342214330001 |
6 | 110434514005151105 |
7 | 4143655035300224 |
oct | 444516664015761 |
9 | 78177067376815 |
10 | 20111030230001 |
11 | 64540492a91a7 |
12 | 230979b3bb495 |
13 | b2b601073699 |
14 | 4d75441bb5bb |
15 | 24d202631cbb |
hex | 124a76d01bf1 |
20111030230001 has 4 divisors (see below), whose sum is σ = 20113685860212. Its totient is φ = 20108374599792.
The previous prime is 20111030229977. The next prime is 20111030230021. The reversal of 20111030230001 is 10003203011102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 11158673011600 + 8952357218401 = 3340460^2 + 2992049^2 .
It is a cyclic number.
It is not a de Polignac number, because 20111030230001 - 218 = 20111029967857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20111030230021) 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, 1327803746 + ... + 1327818891.
It is an arithmetic number, because the mean of its divisors is an integer number (5028421465053).
Almost surely, 220111030230001 is an apocalyptic number.
It is an amenable number.
20111030230001 is a deficient number, since it is larger than the sum of its proper divisors (2655630211).
20111030230001 is an equidigital number, since it uses as much as digits as its factorization.
20111030230001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2655630210.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 20111030230001 its reverse (10003203011102), we get a palindrome (30114233241103).
The spelling of 20111030230001 in words is "twenty trillion, one hundred eleven billion, thirty million, two hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •