Base | Representation |
---|---|
bin | 1011111001011000110111… |
… | …0011111001100111110111 |
3 | 1201022111012100012122222211 |
4 | 2332112031303321213313 |
5 | 3203302433434443033 |
6 | 43453042425234251 |
7 | 2520016223442310 |
oct | 276261563714767 |
9 | 51274170178884 |
10 | 13080554609143 |
11 | 419348308193a |
12 | 1573123332987 |
13 | 73b64c985608 |
14 | 3331606cd607 |
15 | 17a3c66a92cd |
hex | be58dcf99f7 |
13080554609143 has 4 divisors (see below), whose sum is σ = 14949205267600. Its totient is φ = 11211903950688.
The previous prime is 13080554609069. The next prime is 13080554609147. The reversal of 13080554609143 is 34190645508031.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-13080554609143 is a prime.
It is a super-2 number, since 2×130805546091432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13080554609147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 934325329218 + ... + 934325329231.
It is an arithmetic number, because the mean of its divisors is an integer number (3737301316900).
Almost surely, 213080554609143 is an apocalyptic number.
13080554609143 is a deficient number, since it is larger than the sum of its proper divisors (1868650658457).
13080554609143 is an equidigital number, since it uses as much as digits as its factorization.
13080554609143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1868650658456.
The product of its (nonzero) digits is 1555200, while the sum is 49.
The spelling of 13080554609143 in words is "thirteen trillion, eighty billion, five hundred fifty-four million, six hundred nine thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •