Base | Representation |
---|---|
bin | 1011111010110001110110… |
… | …1111111010111100010011 |
3 | 1201101202212020220210120020 |
4 | 2332230131233322330103 |
5 | 3204200400221242210 |
6 | 43512033144514523 |
7 | 2521523226602526 |
oct | 276543557727423 |
9 | 51352766823506 |
10 | 13104444321555 |
11 | 41a2622207414 |
12 | 157788ba7ba43 |
13 | 740989178712 |
14 | 33438941abbd |
15 | 17ad23b62770 |
hex | beb1dbfaf13 |
13104444321555 has 16 divisors (see below), whose sum is σ = 21232517383680. Its totient is φ = 6900568148448.
The previous prime is 13104444321517. The next prime is 13104444321557. The reversal of 13104444321555 is 55512344440131.
It is not a de Polignac number, because 13104444321555 - 27 = 13104444321427 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13104444321557) 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 15 ways as a sum of consecutive naturals, for example, 5529300217 + ... + 5529302586.
It is an arithmetic number, because the mean of its divisors is an integer number (1327032336480).
Almost surely, 213104444321555 is an apocalyptic number.
13104444321555 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13104444321555 is a deficient number, since it is larger than the sum of its proper divisors (8128073062125).
13104444321555 is a wasteful number, since it uses less digits than its factorization.
13104444321555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11058602890.
The product of its (nonzero) digits is 576000, while the sum is 42.
Adding to 13104444321555 its reverse (55512344440131), we get a palindrome (68616788761686).
The spelling of 13104444321555 in words is "thirteen trillion, one hundred four billion, four hundred forty-four million, three hundred twenty-one thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •