Base | Representation |
---|---|
bin | 1011111010100101110100… |
… | …0110010110110101100011 |
3 | 1201101110112000010000201021 |
4 | 2332221131012112311203 |
5 | 3204122240310402131 |
6 | 43510340325150311 |
7 | 2521350152200465 |
oct | 276513506266543 |
9 | 51343460100637 |
10 | 13101212200291 |
11 | 41a1213814916 |
12 | 157712955b397 |
13 | 740592671527 |
14 | 334160070135 |
15 | 17abd501be11 |
hex | bea5d196d63 |
13101212200291 has 2 divisors, whose sum is σ = 13101212200292. Its totient is φ = 13101212200290.
The previous prime is 13101212200261. The next prime is 13101212200339. The reversal of 13101212200291 is 19200221210131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13101212200291 - 215 = 13101212167523 is a prime.
It is a super-2 number, since 2×131012122002912 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13101212200211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6550606100145 + 6550606100146.
It is an arithmetic number, because the mean of its divisors is an integer number (6550606100146).
Almost surely, 213101212200291 is an apocalyptic number.
13101212200291 is a deficient number, since it is larger than the sum of its proper divisors (1).
13101212200291 is an equidigital number, since it uses as much as digits as its factorization.
13101212200291 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 25.
The spelling of 13101212200291 in words is "thirteen trillion, one hundred one billion, two hundred twelve million, two hundred thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •