Base | Representation |
---|---|
bin | 111101000001000000… |
… | …0101010110011101101 |
3 | 110112012201111110122201 |
4 | 1322002000222303231 |
5 | 4121322214413201 |
6 | 140110000341501 |
7 | 12316023412033 |
oct | 1720200526355 |
9 | 415181443581 |
10 | 131030232301 |
11 | 5062a171991 |
12 | 21489914891 |
13 | c482468647 |
14 | 64b0246553 |
15 | 361d517801 |
hex | 1e8202aced |
131030232301 has 4 divisors (see below), whose sum is σ = 133818109632. Its totient is φ = 128242354972.
The previous prime is 131030232241. The next prime is 131030232331. The reversal of 131030232301 is 103232030131.
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 131030232301 - 213 = 131030224109 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 (131030232331) 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, 1393938595 + ... + 1393938688.
It is an arithmetic number, because the mean of its divisors is an integer number (33454527408).
Almost surely, 2131030232301 is an apocalyptic number.
It is an amenable number.
131030232301 is a deficient number, since it is larger than the sum of its proper divisors (2787877331).
131030232301 is an equidigital number, since it uses as much as digits as its factorization.
131030232301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2787877330.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 131030232301 its reverse (103232030131), we get a palindrome (234262262432).
The spelling of 131030232301 in words is "one hundred thirty-one billion, thirty million, two hundred thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •