Base | Representation |
---|---|
bin | 1011111010100101110001… |
… | …1000111101110100000001 |
3 | 1201101110111011201111101101 |
4 | 2332221130120331310001 |
5 | 3204122224234120223 |
6 | 43510335222134401 |
7 | 2521346646101545 |
oct | 276513430756401 |
9 | 51343434644341 |
10 | 13101200301313 |
11 | 41a1208027a53 |
12 | 1577125581401 |
13 | 740590066507 |
14 | 33415c653a25 |
15 | 17abd3e6b4ad |
hex | bea5c63dd01 |
13101200301313 has 8 divisors (see below), whose sum is σ = 13168265850432. Its totient is φ = 13034140429296.
The previous prime is 13101200301257. The next prime is 13101200301337. The reversal of 13101200301313 is 31310300210131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13101200301313 - 29 = 13101200300801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13101200301713) 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 in 7 ways as a sum of consecutive naturals, for example, 3247156 + ... + 6061882.
It is an arithmetic number, because the mean of its divisors is an integer number (1646033231304).
Almost surely, 213101200301313 is an apocalyptic number.
It is an amenable number.
13101200301313 is a deficient number, since it is larger than the sum of its proper divisors (67065549119).
13101200301313 is a wasteful number, since it uses less digits than its factorization.
13101200301313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2838551.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 13101200301313 its reverse (31310300210131), we get a palindrome (44411500511444).
The spelling of 13101200301313 in words is "thirteen trillion, one hundred one billion, two hundred million, three hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •