Base | Representation |
---|---|
bin | 1011111010110010001001… |
… | …0001011000111111010101 |
3 | 1201101210001112201001001020 |
4 | 2332230202101120333111 |
5 | 3204201024133013440 |
6 | 43512044455151353 |
7 | 2521525140600051 |
oct | 276544221307725 |
9 | 51353045631036 |
10 | 13104520204245 |
11 | 41a2661026188 |
12 | 15778b1375559 |
13 | 74099bac6a12 |
14 | 334395530c61 |
15 | 17ad2a6513d0 |
hex | beb22458fd5 |
13104520204245 has 8 divisors (see below), whose sum is σ = 20967232326816. Its totient is φ = 6989077442256.
The previous prime is 13104520204241. The next prime is 13104520204297. The reversal of 13104520204245 is 54240202540131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13104520204245 - 22 = 13104520204241 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13104520204241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 436817340127 + ... + 436817340156.
It is an arithmetic number, because the mean of its divisors is an integer number (2620904040852).
Almost surely, 213104520204245 is an apocalyptic number.
13104520204245 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13104520204245 is a deficient number, since it is larger than the sum of its proper divisors (7862712122571).
13104520204245 is an equidigital number, since it uses as much as digits as its factorization.
13104520204245 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 873634680291.
The product of its (nonzero) digits is 38400, while the sum is 33.
Adding to 13104520204245 its reverse (54240202540131), we get a palindrome (67344722744376).
The spelling of 13104520204245 in words is "thirteen trillion, one hundred four billion, five hundred twenty million, two hundred four thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •