Base | Representation |
---|---|
bin | 11010000000010011… |
… | …11110110010101101 |
3 | 1100000222120111120022 |
4 | 31000021332302231 |
5 | 212043040311310 |
6 | 10225210131525 |
7 | 1002654516344 |
oct | 150011766255 |
9 | 40028514508 |
10 | 13961260205 |
11 | 5a14849482 |
12 | 2857720ba5 |
13 | 1416596b19 |
14 | 9662b0b5b |
15 | 56aa2ea55 |
hex | 34027ecad |
13961260205 has 8 divisors (see below), whose sum is σ = 16774537752. Its totient is φ = 11154991168.
The previous prime is 13961260163. The next prime is 13961260237. The reversal of 13961260205 is 50206216931.
13961260205 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 35844169 + 13925416036 = 5987^2 + 118006^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13961260205 - 212 = 13961256109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1747742 + ... + 1755711.
It is an arithmetic number, because the mean of its divisors is an integer number (2096817219).
Almost surely, 213961260205 is an apocalyptic number.
It is an amenable number.
13961260205 is a deficient number, since it is larger than the sum of its proper divisors (2813277547).
13961260205 is an equidigital number, since it uses as much as digits as its factorization.
13961260205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3504255.
The product of its (nonzero) digits is 19440, while the sum is 35.
The spelling of 13961260205 in words is "thirteen billion, nine hundred sixty-one million, two hundred sixty thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •