Base | Representation |
---|---|
bin | 11001100010001101… |
… | …00101001010100001 |
3 | 1022101101100122120210 |
4 | 30301012211022201 |
5 | 211033412214221 |
6 | 10144145124333 |
7 | 663500055120 |
oct | 146106451241 |
9 | 38341318523 |
10 | 13708710561 |
11 | 58a5234167 |
12 | 27a70296a9 |
13 | 13a6170a70 |
14 | 94092dab7 |
15 | 553795276 |
hex | 3311a52a1 |
13708710561 has 64 divisors (see below), whose sum is σ = 22796361728. Its totient is φ = 7135008768.
The previous prime is 13708710559. The next prime is 13708710623. The reversal of 13708710561 is 16501780731.
It is not a de Polignac number, because 13708710561 - 21 = 13708710559 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (13708710161) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 12895716 + ... + 12896778.
It is an arithmetic number, because the mean of its divisors is an integer number (356193152).
Almost surely, 213708710561 is an apocalyptic number.
It is an amenable number.
13708710561 is a deficient number, since it is larger than the sum of its proper divisors (9087651167).
13708710561 is a wasteful number, since it uses less digits than its factorization.
13708710561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1670.
The product of its (nonzero) digits is 35280, while the sum is 39.
The spelling of 13708710561 in words is "thirteen billion, seven hundred eight million, seven hundred ten thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •