Base | Representation |
---|---|
bin | 11010000001001111… |
… | …10001011011101011 |
3 | 1100001112021021022200 |
4 | 31000213301123223 |
5 | 212102040213203 |
6 | 10230045351243 |
7 | 1003111064013 |
oct | 150047613353 |
9 | 40045237280 |
10 | 13969069803 |
11 | 5a191a2997 |
12 | 285a268523 |
13 | 141809c6a0 |
14 | 967344c43 |
15 | 56b5739a3 |
hex | 3409f16eb |
13969069803 has 24 divisors (see below), whose sum is σ = 22674436512. Its totient is φ = 8222594688.
The previous prime is 13969069789. The next prime is 13969069817. The reversal of 13969069803 is 30896096931.
It is an interprime number because it is at equal distance from previous prime (13969069789) and next prime (13969069817).
It is not a de Polignac number, because 13969069803 - 24 = 13969069787 is a prime.
It is a super-2 number, since 2×139690698032 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13969069803.
It is not an unprimeable number, because it can be changed into a prime (13969069843) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2592826 + ... + 2598207.
It is an arithmetic number, because the mean of its divisors is an integer number (944768188).
Almost surely, 213969069803 is an apocalyptic number.
13969069803 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13969069803 is a deficient number, since it is larger than the sum of its proper divisors (8705366709).
13969069803 is a wasteful number, since it uses less digits than its factorization.
13969069803 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5191075 (or 5191072 counting only the distinct ones).
The product of its (nonzero) digits is 1889568, while the sum is 54.
The spelling of 13969069803 in words is "thirteen billion, nine hundred sixty-nine million, sixty-nine thousand, eight hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •