Base | Representation |
---|---|
bin | 11000101001010010… |
… | …11010100111000111 |
3 | 1021011010000211200101 |
4 | 30110221122213013 |
5 | 204044203144421 |
6 | 10024532424531 |
7 | 645612135505 |
oct | 142451324707 |
9 | 37133024611 |
10 | 13231303111 |
11 | 567a7a8954 |
12 | 2693178147 |
13 | 132b299150 |
14 | 8d7379675 |
15 | 5268e1191 |
hex | 314a5a9c7 |
13231303111 has 8 divisors (see below), whose sum is σ = 14259584304. Its totient is φ = 12204520320.
The previous prime is 13231303097. The next prime is 13231303117. The reversal of 13231303111 is 11130313231.
13231303111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13231303111 - 25 = 13231303079 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13231303117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 356221 + ... + 391606.
It is an arithmetic number, because the mean of its divisors is an integer number (1782448038).
Almost surely, 213231303111 is an apocalyptic number.
13231303111 is a deficient number, since it is larger than the sum of its proper divisors (1028281193).
13231303111 is a wasteful number, since it uses less digits than its factorization.
13231303111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 749201.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 13231303111 its reverse (11130313231), we get a palindrome (24361616342).
The spelling of 13231303111 in words is "thirteen billion, two hundred thirty-one million, three hundred three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •