Base | Representation |
---|---|
bin | 11000010000011110… |
… | …10000111001110101 |
3 | 1020121121022002112022 |
4 | 30020033100321311 |
5 | 203132404333023 |
6 | 5552134402525 |
7 | 640503462560 |
oct | 141017207165 |
9 | 36547262468 |
10 | 13023121013 |
11 | 5583237631 |
12 | 2635500445 |
13 | 12c7108886 |
14 | 8b78674d7 |
15 | 5134bc7c8 |
hex | 3083d0e75 |
13023121013 has 4 divisors (see below), whose sum is σ = 14883566880. Its totient is φ = 11162675148.
The previous prime is 13023121003. The next prime is 13023121039. The reversal of 13023121013 is 31012132031.
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: 31012132031 = 683 ⋅45405757.
It is a cyclic number.
It is not a de Polignac number, because 13023121013 - 216 = 13023055477 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13023120982 and 13023121000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13023121003) 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, 930222923 + ... + 930222936.
It is an arithmetic number, because the mean of its divisors is an integer number (3720891720).
Almost surely, 213023121013 is an apocalyptic number.
It is an amenable number.
13023121013 is a deficient number, since it is larger than the sum of its proper divisors (1860445867).
13023121013 is an equidigital number, since it uses as much as digits as its factorization.
13023121013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1860445866.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 13023121013 its reverse (31012132031), we get a palindrome (44035253044).
The spelling of 13023121013 in words is "thirteen billion, twenty-three million, one hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •