Base | Representation |
---|---|
bin | 1011111010110000010100… |
… | …0011011101011000101101 |
3 | 1201101201210101022202000221 |
4 | 2332230011003131120231 |
5 | 3204144023140403343 |
6 | 43511524104451341 |
7 | 2521510036205014 |
oct | 276540503353055 |
9 | 51351711282027 |
10 | 13104030012973 |
11 | 41a242a359229 |
12 | 1577795179b51 |
13 | 740921397403 |
14 | 33434a3ada7b |
15 | 17acec5c45ed |
hex | beb050dd62d |
13104030012973 has 2 divisors, whose sum is σ = 13104030012974. Its totient is φ = 13104030012972.
The previous prime is 13104030012971. The next prime is 13104030013001. The reversal of 13104030012973 is 37921003040131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10670139844324 + 2433890168649 = 3266518^2 + 1560093^2 .
It is a cyclic number.
It is not a de Polignac number, because 13104030012973 - 21 = 13104030012971 is a prime.
Together with 13104030012971, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13104030012971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6552015006486 + 6552015006487.
It is an arithmetic number, because the mean of its divisors is an integer number (6552015006487).
Almost surely, 213104030012973 is an apocalyptic number.
It is an amenable number.
13104030012973 is a deficient number, since it is larger than the sum of its proper divisors (1).
13104030012973 is an equidigital number, since it uses as much as digits as its factorization.
13104030012973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 34.
The spelling of 13104030012973 in words is "thirteen trillion, one hundred four billion, thirty million, twelve thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •