Base | Representation |
---|---|
bin | 111101000000110000… |
… | …1110001011111010011 |
3 | 110112012011020222210010 |
4 | 1322001201301133103 |
5 | 4121313131230303 |
6 | 140105111010003 |
7 | 12315564520353 |
oct | 1720141613723 |
9 | 415164228703 |
10 | 131022133203 |
11 | 5062563aa15 |
12 | 21487069903 |
13 | c480891090 |
14 | 64ad138b63 |
15 | 361c967c03 |
hex | 1e818717d3 |
131022133203 has 16 divisors (see below), whose sum is σ = 191218518176. Its totient is φ = 79307216640.
The previous prime is 131022133181. The next prime is 131022133217. The reversal of 131022133203 is 302331220131.
It is not a de Polignac number, because 131022133203 - 218 = 131021871059 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131022133203.
It is not an unprimeable number, because it can be changed into a prime (131022133273) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 27534850 + ... + 27539607.
It is an arithmetic number, because the mean of its divisors is an integer number (11951157386).
Almost surely, 2131022133203 is an apocalyptic number.
131022133203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
131022133203 is a deficient number, since it is larger than the sum of its proper divisors (60196384973).
131022133203 is a wasteful number, since it uses less digits than its factorization.
131022133203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55074534.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 131022133203 its reverse (302331220131), we get a palindrome (433353353334).
The spelling of 131022133203 in words is "one hundred thirty-one billion, twenty-two million, one hundred thirty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •