Base | Representation |
---|---|
bin | 100110010111… |
… | …0011100110001 |
3 | 1101211212010101 |
4 | 1030232130301 |
5 | 20122110301 |
6 | 1555032401 |
7 | 332650033 |
oct | 114563461 |
9 | 41755111 |
10 | 20113201 |
11 | 10398389 |
12 | 689b701 |
13 | 4222b04 |
14 | 2957c53 |
15 | 1b74701 |
hex | 132e731 |
20113201 has 4 divisors (see below), whose sum is σ = 20987712. Its totient is φ = 19238692.
The previous prime is 20113189. The next prime is 20113213. The reversal of 20113201 is 10231102.
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 an interprime number because it is at equal distance from previous prime (20113189) and next prime (20113213).
It is a cyclic number.
It is not a de Polignac number, because 20113201 - 25 = 20113169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20113231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 437221 + ... + 437266.
It is an arithmetic number, because the mean of its divisors is an integer number (5246928).
Almost surely, 220113201 is an apocalyptic number.
It is an amenable number.
20113201 is a deficient number, since it is larger than the sum of its proper divisors (874511).
20113201 is an equidigital number, since it uses as much as digits as its factorization.
20113201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 874510.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 20113201 is about 4484.7743532981. The cubic root of 20113201 is about 271.9529231170.
Adding to 20113201 its reverse (10231102), we get a palindrome (30344303).
The spelling of 20113201 in words is "twenty million, one hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •