Base | Representation |
---|---|
bin | 1011111010110101011110… |
… | …0100100001010100100001 |
3 | 1201101212100212022110212102 |
4 | 2332231113210201110201 |
5 | 3204204342042132203 |
6 | 43512313321140145 |
7 | 2521556246331332 |
oct | 276552744412441 |
9 | 51355325273772 |
10 | 13105414411553 |
11 | 41a2a7a861392 |
12 | 1577b0092a655 |
13 | 740ab2142879 |
14 | 33443c1c0289 |
15 | 17ad7ddd6888 |
hex | beb57921521 |
13105414411553 has 2 divisors, whose sum is σ = 13105414411554. Its totient is φ = 13105414411552.
The previous prime is 13105414411489. The next prime is 13105414411561. The reversal of 13105414411553 is 35511441450131.
13105414411553 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10290827716624 + 2814586694929 = 3207932^2 + 1677673^2 .
It is a cyclic number.
It is not a de Polignac number, because 13105414411553 - 26 = 13105414411489 is a prime.
It is not a weakly prime, because it can be changed into another prime (13105414401553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6552707205776 + 6552707205777.
It is an arithmetic number, because the mean of its divisors is an integer number (6552707205777).
Almost surely, 213105414411553 is an apocalyptic number.
It is an amenable number.
13105414411553 is a deficient number, since it is larger than the sum of its proper divisors (1).
13105414411553 is an equidigital number, since it uses as much as digits as its factorization.
13105414411553 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72000, while the sum is 38.
Adding to 13105414411553 its reverse (35511441450131), we get a palindrome (48616855861684).
The spelling of 13105414411553 in words is "thirteen trillion, one hundred five billion, four hundred fourteen million, four hundred eleven thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •