Base | Representation |
---|---|
bin | 111101000000110011… |
… | …0010001000111000111 |
3 | 110112012020110211211110 |
4 | 1322001212101013013 |
5 | 4121313431430203 |
6 | 140105152140103 |
7 | 12315610525143 |
oct | 1720146210707 |
9 | 415166424743 |
10 | 131023311303 |
11 | 50626275055 |
12 | 21487537633 |
13 | c480bb4391 |
14 | 64ad364223 |
15 | 361caebd03 |
hex | 1e819911c7 |
131023311303 has 8 divisors (see below), whose sum is σ = 174716416368. Its totient is φ = 87339540224.
The previous prime is 131023311281. The next prime is 131023311317. The reversal of 131023311303 is 303113320131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131023311303 - 210 = 131023310279 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131023311303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131023311343) 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 7 ways as a sum of consecutive naturals, for example, 2300676 + ... + 2356937.
It is an arithmetic number, because the mean of its divisors is an integer number (21839552046).
Almost surely, 2131023311303 is an apocalyptic number.
131023311303 is a deficient number, since it is larger than the sum of its proper divisors (43693105065).
131023311303 is an equidigital number, since it uses as much as digits as its factorization.
131023311303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4666993.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 131023311303 its reverse (303113320131), we get a palindrome (434136631434).
The spelling of 131023311303 in words is "one hundred thirty-one billion, twenty-three million, three hundred eleven thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •