Base | Representation |
---|---|
bin | 1100000110110011001110… |
… | …1011010101010101010001 |
3 | 1202010111221102122012201210 |
4 | 3001230303223111111101 |
5 | 3221041331441213024 |
6 | 44150550412450333 |
7 | 2542454155450155 |
oct | 301546353252521 |
9 | 52114842565653 |
10 | 13310970647889 |
11 | 4272172a07142 |
12 | 15ab9091799a9 |
13 | 7572b0605545 |
14 | 34037c197065 |
15 | 1813b0038129 |
hex | c1b33ad5551 |
13310970647889 has 4 divisors (see below), whose sum is σ = 17747960863856. Its totient is φ = 8873980431924.
The previous prime is 13310970647873. The next prime is 13310970647929. The reversal of 13310970647889 is 98874607901331.
13310970647889 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 a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 13310970647889 - 24 = 13310970647873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13310970647089) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2218495107979 + ... + 2218495107984.
It is an arithmetic number, because the mean of its divisors is an integer number (4436990215964).
Almost surely, 213310970647889 is an apocalyptic number.
It is an amenable number.
13310970647889 is a deficient number, since it is larger than the sum of its proper divisors (4436990215967).
13310970647889 is an equidigital number, since it uses as much as digits as its factorization.
13310970647889 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4436990215966.
The product of its (nonzero) digits is 54867456, while the sum is 66.
The spelling of 13310970647889 in words is "thirteen trillion, three hundred ten billion, nine hundred seventy million, six hundred forty-seven thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •