Base | Representation |
---|---|
bin | 111101001001000110… |
… | …1011110000000100011 |
3 | 110112220122220212200102 |
4 | 1322102031132000203 |
5 | 4122401304220303 |
6 | 140152550013015 |
7 | 12325533532241 |
oct | 1722215360043 |
9 | 415818825612 |
10 | 131302023203 |
11 | 5075962946a |
12 | 2154494716b |
13 | c4c686a670 |
14 | 64d8395791 |
15 | 3637303288 |
hex | 1e9235e023 |
131302023203 has 4 divisors (see below), whose sum is σ = 141402178848. Its totient is φ = 121201867560.
The previous prime is 131302023199. The next prime is 131302023289. The reversal of 131302023203 is 302320203131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 131302023203 - 22 = 131302023199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131302026203) 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, 5050077803 + ... + 5050077828.
It is an arithmetic number, because the mean of its divisors is an integer number (35350544712).
Almost surely, 2131302023203 is an apocalyptic number.
131302023203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
131302023203 is a deficient number, since it is larger than the sum of its proper divisors (10100155645).
131302023203 is a wasteful number, since it uses less digits than its factorization.
131302023203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10100155644.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 131302023203 its reverse (302320203131), we get a palindrome (433622226334).
The spelling of 131302023203 in words is "one hundred thirty-one billion, three hundred two million, twenty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •