Base | Representation |
---|---|
bin | 10010101110110110… |
… | …001001101101011001 |
3 | 1220220201201112001122 |
4 | 102232312021231121 |
5 | 312143001102223 |
6 | 13123453455025 |
7 | 1311266142341 |
oct | 225666115531 |
9 | 56821645048 |
10 | 20113300313 |
11 | 8591485247 |
12 | 3a93aa1475 |
13 | 1b86cc7242 |
14 | d8b379d21 |
15 | 7cab9b5c8 |
hex | 4aed89b59 |
20113300313 has 4 divisors (see below), whose sum is σ = 20119400400. Its totient is φ = 20107200228.
The previous prime is 20113300303. The next prime is 20113300327. The reversal of 20113300313 is 31300331102.
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 20113300313 - 24 = 20113300297 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20113300291 and 20113300300.
It is not an unprimeable number, because it can be changed into a prime (20113300303) 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, 3045095 + ... + 3051692.
It is an arithmetic number, because the mean of its divisors is an integer number (5029850100).
Almost surely, 220113300313 is an apocalyptic number.
It is an amenable number.
20113300313 is a deficient number, since it is larger than the sum of its proper divisors (6100087).
20113300313 is an equidigital number, since it uses as much as digits as its factorization.
20113300313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6100086.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 20113300313 its reverse (31300331102), we get a palindrome (51413631415).
The spelling of 20113300313 in words is "twenty billion, one hundred thirteen million, three hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •