Base | Representation |
---|---|
bin | 1011111010110001011001… |
… | …1101101100001100010101 |
3 | 1201101202112201221101220102 |
4 | 2332230112131230030111 |
5 | 3204200122424231122 |
6 | 43512013101143445 |
7 | 2521520214005435 |
oct | 276542635541425 |
9 | 51352481841812 |
10 | 13104322102037 |
11 | 41a256a21a051 |
12 | 1577856b5ab85 |
13 | 740969a5548a |
14 | 3343770c42c5 |
15 | 17ad1806e492 |
hex | beb1676c315 |
13104322102037 has 2 divisors, whose sum is σ = 13104322102038. Its totient is φ = 13104322102036.
The previous prime is 13104322102021. The next prime is 13104322102121. The reversal of 13104322102037 is 73020122340131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7842945876676 + 5261376225361 = 2800526^2 + 2293769^2 .
It is an emirp because it is prime and its reverse (73020122340131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13104322102037 - 24 = 13104322102021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13104322102237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6552161051018 + 6552161051019.
It is an arithmetic number, because the mean of its divisors is an integer number (6552161051019).
Almost surely, 213104322102037 is an apocalyptic number.
It is an amenable number.
13104322102037 is a deficient number, since it is larger than the sum of its proper divisors (1).
13104322102037 is an equidigital number, since it uses as much as digits as its factorization.
13104322102037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6048, while the sum is 29.
Adding to 13104322102037 its reverse (73020122340131), we get a palindrome (86124444442168).
The spelling of 13104322102037 in words is "thirteen trillion, one hundred four billion, three hundred twenty-two million, one hundred two thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •