Base | Representation |
---|---|
bin | 10010101000111101… |
… | …000010101100110001 |
3 | 1220122211201001202021 |
4 | 102220331002230301 |
5 | 311442144141223 |
6 | 13110002551441 |
7 | 1305655650454 |
oct | 225075025461 |
9 | 56584631667 |
10 | 20014443313 |
11 | 85406a4547 |
12 | 3a66968581 |
13 | 1b6c693a87 |
14 | d7c1a549b |
15 | 7c217065d |
hex | 4a8f42b31 |
20014443313 has 4 divisors (see below), whose sum is σ = 20024397808. Its totient is φ = 20004488820.
The previous prime is 20014443289. The next prime is 20014443359. The reversal of 20014443313 is 31334441002.
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, and also an emirpimes, since its reverse is a distinct semiprime: 31334441002 = 2 ⋅15667220501.
It is a cyclic number.
It is not a de Polignac number, because 20014443313 - 29 = 20014442801 is a prime.
It is a super-2 number, since 2×200144433132 (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 (20014443373) 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, 4974231 + ... + 4978252.
It is an arithmetic number, because the mean of its divisors is an integer number (5006099452).
Almost surely, 220014443313 is an apocalyptic number.
It is an amenable number.
20014443313 is a deficient number, since it is larger than the sum of its proper divisors (9954495).
20014443313 is an equidigital number, since it uses as much as digits as its factorization.
20014443313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9954494.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 20014443313 its reverse (31334441002), we get a palindrome (51348884315).
The spelling of 20014443313 in words is "twenty billion, fourteen million, four hundred forty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •