Base | Representation |
---|---|
bin | 11000101001010011… |
… | …10111011011001011 |
3 | 1021011010020211120111 |
4 | 30110221313123023 |
5 | 204044220434011 |
6 | 10024535135151 |
7 | 645613136545 |
oct | 142451673313 |
9 | 37133224514 |
10 | 13231421131 |
11 | 567a879595 |
12 | 26932144b7 |
13 | 132b30aa96 |
14 | 8d73aa695 |
15 | 526916121 |
hex | 314a776cb |
13231421131 has 4 divisors (see below), whose sum is σ = 13232214352. Its totient is φ = 13230627912.
The previous prime is 13231421107. The next prime is 13231421171. The reversal of 13231421131 is 13112413231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13112413231 = 27407 ⋅478433.
It is a cyclic number.
It is not a de Polignac number, because 13231421131 - 27 = 13231421003 is a prime.
It is a super-2 number, since 2×132314211312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13231421171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 371040 + ... + 405133.
It is an arithmetic number, because the mean of its divisors is an integer number (3308053588).
Almost surely, 213231421131 is an apocalyptic number.
13231421131 is a deficient number, since it is larger than the sum of its proper divisors (793221).
13231421131 is an equidigital number, since it uses as much as digits as its factorization.
13231421131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 793220.
The product of its digits is 432, while the sum is 22.
Adding to 13231421131 its reverse (13112413231), we get a palindrome (26343834362).
The spelling of 13231421131 in words is "thirteen billion, two hundred thirty-one million, four hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •