Base | Representation |
---|---|
bin | 1011110110100001000100… |
… | …1111110011010111101111 |
3 | 1201010202212010200112011011 |
4 | 2331220101033303113233 |
5 | 3202000414323200221 |
6 | 43414243200210051 |
7 | 2513321532342364 |
oct | 275502117632757 |
9 | 51122763615134 |
10 | 13031220131311 |
11 | 417456704a508 |
12 | 1565655309927 |
13 | 736ab9a72ab5 |
14 | 330a0052046b |
15 | 178e8a4761e1 |
hex | bda113f35ef |
13031220131311 has 4 divisors (see below), whose sum is σ = 13032031101400. Its totient is φ = 13030409161224.
The previous prime is 13031220131239. The next prime is 13031220131353. The reversal of 13031220131311 is 11313102213031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13031220131311 - 225 = 13031186576879 is a prime.
It is a super-2 number, since 2×130312201313112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13031220131411) 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, 405460941 + ... + 405493078.
It is an arithmetic number, because the mean of its divisors is an integer number (3258007775350).
Almost surely, 213031220131311 is an apocalyptic number.
13031220131311 is a deficient number, since it is larger than the sum of its proper divisors (810970089).
13031220131311 is an equidigital number, since it uses as much as digits as its factorization.
13031220131311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 810970088.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 13031220131311 its reverse (11313102213031), we get a palindrome (24344322344342).
The spelling of 13031220131311 in words is "thirteen trillion, thirty-one billion, two hundred twenty million, one hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •