Base | Representation |
---|---|
bin | 11000110010101110… |
… | …01111011110111101 |
3 | 1021100121220122112111 |
4 | 30121113033132331 |
5 | 204224432100041 |
6 | 10040440334021 |
7 | 650562513565 |
oct | 143127173675 |
9 | 37317818474 |
10 | 13310425021 |
11 | 571042a363 |
12 | 26b5774311 |
13 | 13417ac94a |
14 | 903a93da5 |
15 | 52d81e981 |
hex | 3195cf7bd |
13310425021 has 4 divisors (see below), whose sum is σ = 13312818972. Its totient is φ = 13308031072.
The previous prime is 13310424991. The next prime is 13310425027. The reversal of 13310425021 is 12052401331.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4798332900 + 8512092121 = 69270^2 + 92261^2 .
It is a cyclic number.
It is not a de Polignac number, because 13310425021 - 29 = 13310424509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13310424983 and 13310425001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13310425027) 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, 1188616 + ... + 1199761.
It is an arithmetic number, because the mean of its divisors is an integer number (3328204743).
Almost surely, 213310425021 is an apocalyptic number.
It is an amenable number.
13310425021 is a deficient number, since it is larger than the sum of its proper divisors (2393951).
13310425021 is an equidigital number, since it uses as much as digits as its factorization.
13310425021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2393950.
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 13310425021 its reverse (12052401331), we get a palindrome (25362826352).
The spelling of 13310425021 in words is "thirteen billion, three hundred ten million, four hundred twenty-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •