Base | Representation |
---|---|
bin | 10010101110010000… |
… | …000011001010001101 |
3 | 1220220000221001200121 |
4 | 102232100003022031 |
5 | 312132421441023 |
6 | 13122455424541 |
7 | 1311115222051 |
oct | 225620031215 |
9 | 56800831617 |
10 | 20103312013 |
11 | 8586882954 |
12 | 3a90685151 |
13 | 1b84c0aac5 |
14 | d89cd9c61 |
15 | 7c9d76d5d |
hex | 4ae40328d |
20103312013 has 8 divisors (see below), whose sum is σ = 20136556440. Its totient is φ = 20070089280.
The previous prime is 20103312001. The next prime is 20103312041. The reversal of 20103312013 is 31021330102.
It can be written as a sum of positive squares in 4 ways, for example, as 10111710249 + 9991601764 = 100557^2 + 99958^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20103312013 - 25 = 20103311981 is a prime.
It is a super-2 number, since 2×201033120132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20103318013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3871623 + ... + 3876811.
It is an arithmetic number, because the mean of its divisors is an integer number (2517069555).
Almost surely, 220103312013 is an apocalyptic number.
It is an amenable number.
20103312013 is a deficient number, since it is larger than the sum of its proper divisors (33244427).
20103312013 is an equidigital number, since it uses as much as digits as its factorization.
20103312013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10847.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 20103312013 its reverse (31021330102), we get a palindrome (51124642115).
The spelling of 20103312013 in words is "twenty billion, one hundred three million, three hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •