Base | Representation |
---|---|
bin | 11000011100001000… |
… | …00111011000111111 |
3 | 1020212102012211121221 |
4 | 30032010013120333 |
5 | 203332420034014 |
6 | 10005545334211 |
7 | 643101325165 |
oct | 141604073077 |
9 | 36772184557 |
10 | 13120861759 |
11 | 5623425705 |
12 | 2662197367 |
13 | 131143ac35 |
14 | 8c682b235 |
15 | 51bd77b24 |
hex | 30e10763f |
13120861759 has 4 divisors (see below), whose sum is σ = 13143921840. Its totient is φ = 13097801680.
The previous prime is 13120861751. The next prime is 13120861807. The reversal of 13120861759 is 95716802131.
13120861759 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 95716802131 = 7211 ⋅13273721.
It is a cyclic number.
It is not a de Polignac number, because 13120861759 - 23 = 13120861751 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13120861751) 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 3 ways as a sum of consecutive naturals, for example, 11529187 + ... + 11530324.
It is an arithmetic number, because the mean of its divisors is an integer number (3285980460).
Almost surely, 213120861759 is an apocalyptic number.
13120861759 is a deficient number, since it is larger than the sum of its proper divisors (23060081).
13120861759 is an equidigital number, since it uses as much as digits as its factorization.
13120861759 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23060080.
The product of its (nonzero) digits is 90720, while the sum is 43.
The spelling of 13120861759 in words is "thirteen billion, one hundred twenty million, eight hundred sixty-one thousand, seven hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •