Base | Representation |
---|---|
bin | 1011111010100101110100… |
… | …0110010110110101111001 |
3 | 1201101110112000010000202002 |
4 | 2332221131012112311321 |
5 | 3204122240310402223 |
6 | 43510340325150345 |
7 | 2521350152200526 |
oct | 276513506266571 |
9 | 51343460100662 |
10 | 13101212200313 |
11 | 41a1213814936 |
12 | 157712955b3b5 |
13 | 740592671543 |
14 | 33416007014d |
15 | 17abd501be28 |
hex | bea5d196d79 |
13101212200313 has 8 divisors (see below), whose sum is σ = 13792582980000. Its totient is φ = 12410024750208.
The previous prime is 13101212200291. The next prime is 13101212200339. The reversal of 13101212200313 is 31300221210131.
It is a happy number.
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 13101212200313 - 222 = 13101208006009 is a prime.
It is a super-2 number, since 2×131012122003132 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13101212200613) 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, 45685688 + ... + 45971561.
It is an arithmetic number, because the mean of its divisors is an integer number (1724072872500).
Almost surely, 213101212200313 is an apocalyptic number.
It is an amenable number.
13101212200313 is a deficient number, since it is larger than the sum of its proper divisors (691370779687).
13101212200313 is an equidigital number, since it uses as much as digits as its factorization.
13101212200313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91664791.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13101212200313 its reverse (31300221210131), we get a palindrome (44401433410444).
The spelling of 13101212200313 in words is "thirteen trillion, one hundred one billion, two hundred twelve million, two hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •