Base | Representation |
---|---|
bin | 111101000001000000… |
… | …0111100000111101101 |
3 | 110112012201122001221002 |
4 | 1322002000330013231 |
5 | 4121322224200323 |
6 | 140110002050045 |
7 | 12316024125545 |
oct | 1720200740755 |
9 | 415181561832 |
10 | 131030303213 |
11 | 5062a210197 |
12 | 21489949925 |
13 | c4824919c4 |
14 | 64b0264325 |
15 | 361d52d828 |
hex | 1e8203c1ed |
131030303213 has 4 divisors (see below), whose sum is σ = 131063741760. Its totient is φ = 130996864668.
The previous prime is 131030303197. The next prime is 131030303237. The reversal of 131030303213 is 312303030131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 131030303213 - 24 = 131030303197 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 (131030303513) 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 3 ways as a sum of consecutive naturals, for example, 16713395 + ... + 16721232.
It is an arithmetic number, because the mean of its divisors is an integer number (32765935440).
Almost surely, 2131030303213 is an apocalyptic number.
It is an amenable number.
131030303213 is a deficient number, since it is larger than the sum of its proper divisors (33438547).
131030303213 is an equidigital number, since it uses as much as digits as its factorization.
131030303213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33438546.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 131030303213 its reverse (312303030131), we get a palindrome (443333333344).
The spelling of 131030303213 in words is "one hundred thirty-one billion, thirty million, three hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •