Base | Representation |
---|---|
bin | 10010101000110000… |
… | …010111011010111001 |
3 | 1220122121110020110012 |
4 | 102220300113122321 |
5 | 311440321322223 |
6 | 13105403431305 |
7 | 1305615500432 |
oct | 225060273271 |
9 | 56577406405 |
10 | 20011120313 |
11 | 8539834968 |
12 | 3a65825535 |
13 | 1b6ba9c3c2 |
14 | d7b97c489 |
15 | 7c1c15c78 |
hex | 4a8c176b9 |
20011120313 has 4 divisors (see below), whose sum is σ = 20476495248. Its totient is φ = 19545745380.
The previous prime is 20011120309. The next prime is 20011120319. The reversal of 20011120313 is 31302111002.
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 20011120313 - 22 = 20011120309 is a prime.
It is a super-2 number, since 2×200111203132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20011120319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 232687403 + ... + 232687488.
It is an arithmetic number, because the mean of its divisors is an integer number (5119123812).
Almost surely, 220011120313 is an apocalyptic number.
It is an amenable number.
20011120313 is a deficient number, since it is larger than the sum of its proper divisors (465374935).
20011120313 is an equidigital number, since it uses as much as digits as its factorization.
20011120313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 465374934.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 20011120313 its reverse (31302111002), we get a palindrome (51313231315).
The spelling of 20011120313 in words is "twenty billion, eleven million, one hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •