Base | Representation |
---|---|
bin | 11000011100000001… |
… | …11001111000101101 |
3 | 1020212100122001222011 |
4 | 30032000321320231 |
5 | 203332211120023 |
6 | 10005515321221 |
7 | 643061221132 |
oct | 141600717055 |
9 | 36770561864 |
10 | 13120020013 |
11 | 5622a00251 |
12 | 2661a50211 |
13 | 1311204a69 |
14 | 8c668c589 |
15 | 51bc5d50d |
hex | 30e039e2d |
13120020013 has 4 divisors (see below), whose sum is σ = 13120345440. Its totient is φ = 13119694588.
The previous prime is 13120019989. The next prime is 13120020047. The reversal of 13120020013 is 31002002131.
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: 31002002131 = 127 ⋅244110253.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13120020013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13120019975 and 13120020002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13120020313) 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, 91993 + ... + 186286.
It is an arithmetic number, because the mean of its divisors is an integer number (3280086360).
Almost surely, 213120020013 is an apocalyptic number.
It is an amenable number.
13120020013 is a deficient number, since it is larger than the sum of its proper divisors (325427).
13120020013 is an equidigital number, since it uses as much as digits as its factorization.
13120020013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 325426.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 13120020013 its reverse (31002002131), we get a palindrome (44122022144).
The spelling of 13120020013 in words is "thirteen billion, one hundred twenty million, twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •