Base | Representation |
---|---|
bin | 11000010001101010… |
… | …00001101011100011 |
3 | 1020122021221000120022 |
4 | 30020311001223203 |
5 | 203142423121011 |
6 | 5553130504055 |
7 | 640653562145 |
oct | 141065015343 |
9 | 36567830508 |
10 | 13033020131 |
11 | 5588888a1a |
12 | 263889502b |
13 | 12c9193541 |
14 | 8b8cc2c95 |
15 | 5142c58db |
hex | 308d41ae3 |
13033020131 has 4 divisors (see below), whose sum is σ = 13799668392. Its totient is φ = 12266371872.
The previous prime is 13033020109. The next prime is 13033020139. The reversal of 13033020131 is 13102033031.
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 13033020131 - 210 = 13033019107 is a prime.
It is a super-2 number, since 2×130330201312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17), and also a Moran number because the ratio is a prime number: 766648243 = 13033020131 / (1 + 3 + 0 + 3 + 3 + 0 + 2 + 0 + 1 + 3 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13033020139) 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, 383324105 + ... + 383324138.
It is an arithmetic number, because the mean of its divisors is an integer number (3449917098).
Almost surely, 213033020131 is an apocalyptic number.
13033020131 is a deficient number, since it is larger than the sum of its proper divisors (766648261).
13033020131 is an equidigital number, since it uses as much as digits as its factorization.
13033020131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 766648260.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 13033020131 its reverse (13102033031), we get a palindrome (26135053162).
The spelling of 13033020131 in words is "thirteen billion, thirty-three million, twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •