Base | Representation |
---|---|
bin | 100110010111… |
… | …0010011100101 |
3 | 1101211211022121 |
4 | 1030232103211 |
5 | 20122100423 |
6 | 1555025541 |
7 | 332645233 |
oct | 114562345 |
9 | 41754277 |
10 | 20112613 |
11 | 103979a4 |
12 | 689b2b1 |
13 | 4222771 |
14 | 2957953 |
15 | 1b7445d |
hex | 132e4e5 |
20112613 has 4 divisors (see below), whose sum is σ = 20154400. Its totient is φ = 20070828.
The previous prime is 20112611. The next prime is 20112629. The reversal of 20112613 is 31621102.
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 a cyclic number.
It is not a de Polignac number, because 20112613 - 21 = 20112611 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112611) 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, 20163 + ... + 21136.
It is an arithmetic number, because the mean of its divisors is an integer number (5038600).
Almost surely, 220112613 is an apocalyptic number.
It is an amenable number.
20112613 is a deficient number, since it is larger than the sum of its proper divisors (41787).
20112613 is an equidigital number, since it uses as much as digits as its factorization.
20112613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41786.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 20112613 is about 4484.7087976813. The cubic root of 20112613 is about 271.9502729524.
Adding to 20112613 its reverse (31621102), we get a palindrome (51733715).
It can be divided in two parts, 2011 and 2613, that added together give a square (4624 = 682).
The spelling of 20112613 in words is "twenty million, one hundred twelve thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •