Base | Representation |
---|---|
bin | 11010000100001010… |
… | …01100101010000001 |
3 | 1100010020100112112010 |
4 | 31002011030222001 |
5 | 212124322420310 |
6 | 10232322323133 |
7 | 1003526206035 |
oct | 150205145201 |
9 | 40106315463 |
10 | 13993560705 |
11 | 5a31000303 |
12 | 28664b94a9 |
13 | 1420195c47 |
14 | 96a6bc1c5 |
15 | 56d7b0320 |
hex | 34214ca81 |
13993560705 has 64 divisors (see below), whose sum is σ = 24327244800. Its totient is φ = 6846301440.
The previous prime is 13993560701. The next prime is 13993560769. The reversal of 13993560705 is 50706539931.
It is not a de Polignac number, because 13993560705 - 22 = 13993560701 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (13993560701) 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, 1120395 + ... + 1132815.
It is an arithmetic number, because the mean of its divisors is an integer number (380113200).
Almost surely, 213993560705 is an apocalyptic number.
13993560705 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13993560705 is a deficient number, since it is larger than the sum of its proper divisors (10333684095).
13993560705 is a wasteful number, since it uses less digits than its factorization.
13993560705 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12574.
The product of its (nonzero) digits is 765450, while the sum is 48.
The spelling of 13993560705 in words is "thirteen billion, nine hundred ninety-three million, five hundred sixty thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •