Base | Representation |
---|---|
bin | 1011111011001011001001… |
… | …0010001100101001010111 |
3 | 1201102102101020211010202220 |
4 | 2332302302102030221113 |
5 | 3204303300203132411 |
6 | 43515114433233423 |
7 | 2522153351151306 |
oct | 276626222145127 |
9 | 51372336733686 |
10 | 13111231302231 |
11 | 41a5495296457 |
12 | 1579064a02873 |
13 | 7414cb2b940a |
14 | 33483096643d |
15 | 17b0be8eeb06 |
hex | becb248ca57 |
13111231302231 has 16 divisors (see below), whose sum is σ = 17995016371200. Its totient is φ = 8485209809568.
The previous prime is 13111231302151. The next prime is 13111231302287. The reversal of 13111231302231 is 13220313211131.
It is not a de Polignac number, because 13111231302231 - 215 = 13111231269463 is a prime.
It is a super-2 number, since 2×131112313022312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111231302131) 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 15 ways as a sum of consecutive naturals, for example, 134483391 + ... + 134580848.
It is an arithmetic number, because the mean of its divisors is an integer number (1124688523200).
Almost surely, 213111231302231 is an apocalyptic number.
13111231302231 is a deficient number, since it is larger than the sum of its proper divisors (4883785068969).
13111231302231 is a wasteful number, since it uses less digits than its factorization.
13111231302231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269064718.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 13111231302231 its reverse (13220313211131), we get a palindrome (26331544513362).
The spelling of 13111231302231 in words is "thirteen trillion, one hundred eleven billion, two hundred thirty-one million, three hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •