Base | Representation |
---|---|
bin | 111101001001001000… |
… | …1111101111000000110 |
3 | 110112220202010210010001 |
4 | 1322102101331320012 |
5 | 4122402104433220 |
6 | 140153031151514 |
7 | 12325546543000 |
oct | 1722221757006 |
9 | 415822123101 |
10 | 131303202310 |
11 | 5075a264335 |
12 | 2154521559a |
13 | c4c6b91267 |
14 | 64d85c1370 |
15 | 363748780a |
hex | 1e9247de06 |
131303202310 has 64 divisors (see below), whose sum is σ = 276071616000. Its totient is φ = 44944786656.
The previous prime is 131303202271. The next prime is 131303202323. The reversal of 131303202310 is 13202303131.
It is a super-3 number, since 3×1313032023103 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 2092249 + ... + 2154091.
It is an arithmetic number, because the mean of its divisors is an integer number (4313619000).
Almost surely, 2131303202310 is an apocalyptic number.
131303202310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131303202310 is an abundant number, since it is smaller than the sum of its proper divisors (144768413690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131303202310 is an equidigital number, since it uses as much as digits as its factorization.
131303202310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62490 (or 62476 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 131303202310 its reverse (13202303131), we get a palindrome (144505505441).
The spelling of 131303202310 in words is "one hundred thirty-one billion, three hundred three million, two hundred two thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •