Base | Representation |
---|---|
bin | 1011111010110000010100… |
… | …0011011101011001001001 |
3 | 1201101201210101022202001222 |
4 | 2332230011003131121021 |
5 | 3204144023140404001 |
6 | 43511524104451425 |
7 | 2521510036205054 |
oct | 276540503353111 |
9 | 51351711282058 |
10 | 13104030013001 |
11 | 41a242a359254 |
12 | 1577795179b75 |
13 | 740921397425 |
14 | 33434a3ada9b |
15 | 17acec5c461b |
hex | beb050dd649 |
13104030013001 has 2 divisors, whose sum is σ = 13104030013002. Its totient is φ = 13104030013000.
The previous prime is 13104030012973. The next prime is 13104030013033. The reversal of 13104030013001 is 10031003040131.
13104030013001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6863771214400 + 6240258798601 = 2619880^2 + 2498051^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13104030013001 is a prime.
It is not a weakly prime, because it can be changed into another prime (13104030013091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6552015006500 + 6552015006501.
It is an arithmetic number, because the mean of its divisors is an integer number (6552015006501).
Almost surely, 213104030013001 is an apocalyptic number.
It is an amenable number.
13104030013001 is a deficient number, since it is larger than the sum of its proper divisors (1).
13104030013001 is an equidigital number, since it uses as much as digits as its factorization.
13104030013001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 13104030013001 its reverse (10031003040131), we get a palindrome (23135033053132).
The spelling of 13104030013001 in words is "thirteen trillion, one hundred four billion, thirty million, thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •