Base | Representation |
---|---|
bin | 10010101001111101… |
… | …010110100101111101 |
3 | 1220201000102120112120 |
4 | 102221331112211331 |
5 | 312011003131023 |
6 | 13111404153153 |
7 | 1306252154262 |
oct | 225175264575 |
9 | 56630376476 |
10 | 20031302013 |
11 | 854a169758 |
12 | 3a705387b9 |
13 | 1b73017438 |
14 | d80513269 |
15 | 7c38a08e3 |
hex | 4a9f5697d |
20031302013 has 4 divisors (see below), whose sum is σ = 26708402688. Its totient is φ = 13354201340.
The previous prime is 20031302009. The next prime is 20031302033. The reversal of 20031302013 is 31020313002.
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 20031302013 - 22 = 20031302009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20031301983 and 20031302001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20031302003) 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, 3338550333 + ... + 3338550338.
It is an arithmetic number, because the mean of its divisors is an integer number (6677100672).
Almost surely, 220031302013 is an apocalyptic number.
It is an amenable number.
20031302013 is a deficient number, since it is larger than the sum of its proper divisors (6677100675).
20031302013 is an equidigital number, since it uses as much as digits as its factorization.
20031302013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6677100674.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 20031302013 its reverse (31020313002), we get a palindrome (51051615015).
The spelling of 20031302013 in words is "twenty billion, thirty-one million, three hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •