Base | Representation |
---|---|
bin | 111100101100001011… |
… | …0000100111100010111 |
3 | 110110102000011000101202 |
4 | 1321120112010330113 |
5 | 4113404241420203 |
6 | 135512345543115 |
7 | 12262504634552 |
oct | 1713026047427 |
9 | 413360130352 |
10 | 130331201303 |
11 | 50300624616 |
12 | 213137a4a9b |
13 | c3a06a8334 |
14 | 6445481699 |
15 | 35cbe87388 |
hex | 1e58584f17 |
130331201303 has 4 divisors (see below), whose sum is σ = 130337811120. Its totient is φ = 130324591488.
The previous prime is 130331201291. The next prime is 130331201311. The reversal of 130331201303 is 303102133031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 303102133031 = 613 ⋅494456987.
It is a cyclic number.
It is not a de Polignac number, because 130331201303 - 212 = 130331197207 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 (130331501303) 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, 3275243 + ... + 3314796.
It is an arithmetic number, because the mean of its divisors is an integer number (32584452780).
Almost surely, 2130331201303 is an apocalyptic number.
130331201303 is a deficient number, since it is larger than the sum of its proper divisors (6609817).
130331201303 is an equidigital number, since it uses as much as digits as its factorization.
130331201303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6609816.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 130331201303 its reverse (303102133031), we get a palindrome (433433334334).
The spelling of 130331201303 in words is "one hundred thirty billion, three hundred thirty-one million, two hundred one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •