Base | Representation |
---|---|
bin | 11001101010110010… |
… | …01110101000010101 |
3 | 1022120101211111022110 |
4 | 30311121032220111 |
5 | 211210330122421 |
6 | 10155240221233 |
7 | 665333040564 |
oct | 146531165025 |
9 | 38511744273 |
10 | 13780707861 |
11 | 5931939868 |
12 | 280716a819 |
13 | 13b805b70b |
14 | 94a311bdb |
15 | 559c67a76 |
hex | 33564ea15 |
13780707861 has 8 divisors (see below), whose sum is σ = 18374876064. Its totient is φ = 9186839120.
The previous prime is 13780707859. The next prime is 13780707901. The reversal of 13780707861 is 16870708731.
13780707861 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13780707861 - 21 = 13780707859 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13780707861.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13780727861) by changing a digit.
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, 75871 + ... + 182531.
It is an arithmetic number, because the mean of its divisors is an integer number (2296859508).
Almost surely, 213780707861 is an apocalyptic number.
It is an amenable number.
13780707861 is a deficient number, since it is larger than the sum of its proper divisors (4594168203).
13780707861 is a wasteful number, since it uses less digits than its factorization.
13780707861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149731.
The product of its (nonzero) digits is 395136, while the sum is 48.
The spelling of 13780707861 in words is "thirteen billion, seven hundred eighty million, seven hundred seven thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •