Base | Representation |
---|---|
bin | 11000010101011010… |
… | …11000000111000101 |
3 | 1020201111021212212111 |
4 | 30022231120013011 |
5 | 203224012204120 |
6 | 10000215021021 |
7 | 641516002165 |
oct | 141255300705 |
9 | 36644255774 |
10 | 13064569285 |
11 | 55a46772a9 |
12 | 264736a771 |
13 | 130288b691 |
14 | 8bd1765a5 |
15 | 516e5875a |
hex | 30ab581c5 |
13064569285 has 4 divisors (see below), whose sum is σ = 15677483148. Its totient is φ = 10451655424.
The previous prime is 13064569253. The next prime is 13064569291. The reversal of 13064569285 is 58296546031.
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 1469802244 + 11594767041 = 38338^2 + 107679^2 .
It is a cyclic number.
It is not a de Polignac number, because 13064569285 - 25 = 13064569253 is a prime.
It is a super-2 number, since 2×130645692852 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1306456924 + ... + 1306456933.
It is an arithmetic number, because the mean of its divisors is an integer number (3919370787).
Almost surely, 213064569285 is an apocalyptic number.
It is an amenable number.
13064569285 is a deficient number, since it is larger than the sum of its proper divisors (2612913863).
13064569285 is an equidigital number, since it uses as much as digits as its factorization.
13064569285 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2612913862.
The product of its (nonzero) digits is 1555200, while the sum is 49.
The spelling of 13064569285 in words is "thirteen billion, sixty-four million, five hundred sixty-nine thousand, two hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •