Base | Representation |
---|---|
bin | 1011111010101101111111… |
… | …0000111111000110010001 |
3 | 1201101200011210010222122202 |
4 | 2332223133300333012101 |
5 | 3204141233012211304 |
6 | 43511342040012545 |
7 | 2521455401535236 |
oct | 276533760770621 |
9 | 51350153128582 |
10 | 13103404413329 |
11 | 41a2139205a2a |
12 | 157763b761155 |
13 | 7408518a76c9 |
14 | 3342cb28178d |
15 | 17acb26eb81e |
hex | beadfc3f191 |
13103404413329 has 2 divisors, whose sum is σ = 13103404413330. Its totient is φ = 13103404413328.
The previous prime is 13103404413277. The next prime is 13103404413331. The reversal of 13103404413329 is 92331440430131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12536365292929 + 567039120400 = 3540673^2 + 753020^2 .
It is a cyclic number.
It is not a de Polignac number, because 13103404413329 - 212 = 13103404409233 is a prime.
Together with 13103404413331, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 13103404413292 and 13103404413301.
It is not a weakly prime, because it can be changed into another prime (13103404418329) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6551702206664 + 6551702206665.
It is an arithmetic number, because the mean of its divisors is an integer number (6551702206665).
Almost surely, 213103404413329 is an apocalyptic number.
It is an amenable number.
13103404413329 is a deficient number, since it is larger than the sum of its proper divisors (1).
13103404413329 is an equidigital number, since it uses as much as digits as its factorization.
13103404413329 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 93312, while the sum is 38.
The spelling of 13103404413329 in words is "thirteen trillion, one hundred three billion, four hundred four million, four hundred thirteen thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •