Base | Representation |
---|---|
bin | 11000010001011011… |
… | …01111111010001011 |
3 | 1020122011100002120001 |
4 | 30020231233322023 |
5 | 203141431043311 |
6 | 5553021543431 |
7 | 640631425066 |
oct | 141055577213 |
9 | 36564302501 |
10 | 13031112331 |
11 | 55877a5626 |
12 | 2638114b77 |
13 | 12c8976073 |
14 | 8b89478dd |
15 | 51404a4c1 |
hex | 308b6fe8b |
13031112331 has 4 divisors (see below), whose sum is σ = 13196063200. Its totient is φ = 12866161464.
The previous prime is 13031112319. The next prime is 13031112383. The reversal of 13031112331 is 13321113031.
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 13031112331 - 215 = 13031079563 is a prime.
It is a super-2 number, since 2×130311123312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13031112299 and 13031112308.
It is not an unprimeable number, because it can be changed into a prime (13031112131) 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, 82475316 + ... + 82475473.
It is an arithmetic number, because the mean of its divisors is an integer number (3299015800).
Almost surely, 213031112331 is an apocalyptic number.
13031112331 is a deficient number, since it is larger than the sum of its proper divisors (164950869).
13031112331 is an equidigital number, since it uses as much as digits as its factorization.
13031112331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164950868.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 13031112331 its reverse (13321113031), we get a palindrome (26352225362).
The spelling of 13031112331 in words is "thirteen billion, thirty-one million, one hundred twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •