Base | Representation |
---|---|
bin | 1011111100110111011110… |
… | …1001000100001011101001 |
3 | 1201112012102221200102122112 |
4 | 2333031313221010023221 |
5 | 3210242324411242301 |
6 | 43540324234132105 |
7 | 2524233120622346 |
oct | 277156751041351 |
9 | 51465387612575 |
10 | 13140312212201 |
11 | 4206858749549 |
12 | 158281bb81035 |
13 | 744184132955 |
14 | 335dcccc57cd |
15 | 17bc229ca9bb |
hex | bf377a442e9 |
13140312212201 has 4 divisors (see below), whose sum is σ = 13363029368400. Its totient is φ = 12917595056004.
The previous prime is 13140312212197. The next prime is 13140312212207. The reversal of 13140312212201 is 10221221304131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13140312212201 - 22 = 13140312212197 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (13140312212207) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 111358578011 + ... + 111358578128.
It is an arithmetic number, because the mean of its divisors is an integer number (3340757342100).
Almost surely, 213140312212201 is an apocalyptic number.
It is an amenable number.
13140312212201 is a deficient number, since it is larger than the sum of its proper divisors (222717156199).
13140312212201 is an equidigital number, since it uses as much as digits as its factorization.
13140312212201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222717156198.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 13140312212201 its reverse (10221221304131), we get a palindrome (23361533516332).
The spelling of 13140312212201 in words is "thirteen trillion, one hundred forty billion, three hundred twelve million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •