Base | Representation |
---|---|
bin | 10010101111111101… |
… | …100011111100101101 |
3 | 1220222000221120122212 |
4 | 102233331203330231 |
5 | 312212244120023 |
6 | 13125403020205 |
7 | 1311614226620 |
oct | 225775437455 |
9 | 56860846585 |
10 | 20132020013 |
11 | 85a1000676 |
12 | 3a9a20a665 |
13 | 1b8ab4c9a1 |
14 | d8da4ddb7 |
15 | 7cc647e78 |
hex | 4aff63f2d |
20132020013 has 8 divisors (see below), whose sum is σ = 23629861632. Its totient is φ = 16789638096.
The previous prime is 20132019961. The next prime is 20132020049. The reversal of 20132020013 is 31002023102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20132020013 - 216 = 20131954477 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 20132020013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20132020813) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38864645 + ... + 38865162.
It is an arithmetic number, because the mean of its divisors is an integer number (2953732704).
Almost surely, 220132020013 is an apocalyptic number.
It is an amenable number.
20132020013 is a deficient number, since it is larger than the sum of its proper divisors (3497841619).
20132020013 is an equidigital number, since it uses as much as digits as its factorization.
20132020013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77729851.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 20132020013 its reverse (31002023102), we get a palindrome (51134043115).
The spelling of 20132020013 in words is "twenty billion, one hundred thirty-two million, twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •