Base | Representation |
---|---|
bin | 1011111010110010001010… |
… | …0000110000001101110111 |
3 | 1201101210001211021122110102 |
4 | 2332230202200300031313 |
5 | 3204201031200402133 |
6 | 43512045121344315 |
7 | 2521525220042333 |
oct | 276544240601567 |
9 | 51353054248412 |
10 | 13104524231543 |
11 | 41a2663326a28 |
12 | 15778b279809b |
13 | 74099c8a6b34 |
14 | 334395c9c7c3 |
15 | 17ad2ab997e8 |
hex | beb22830377 |
13104524231543 has 2 divisors, whose sum is σ = 13104524231544. Its totient is φ = 13104524231542.
The previous prime is 13104524231459. The next prime is 13104524231587. The reversal of 13104524231543 is 34513242540131.
13104524231543 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 is a cyclic number.
It is not a de Polignac number, because 13104524231543 - 28 = 13104524231287 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13104524231497 and 13104524231506.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13104524531543) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6552262115771 + 6552262115772.
It is an arithmetic number, because the mean of its divisors is an integer number (6552262115772).
Almost surely, 213104524231543 is an apocalyptic number.
13104524231543 is a deficient number, since it is larger than the sum of its proper divisors (1).
13104524231543 is an equidigital number, since it uses as much as digits as its factorization.
13104524231543 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 172800, while the sum is 38.
Adding to 13104524231543 its reverse (34513242540131), we get a palindrome (47617766771674).
The spelling of 13104524231543 in words is "thirteen trillion, one hundred four billion, five hundred twenty-four million, two hundred thirty-one thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •