Base | Representation |
---|---|
bin | 11101110010011110100111… |
… | …101010101111100111001111 |
3 | 122011212122101111200202220210 |
4 | 131302132213222233213033 |
5 | 114133000441302230111 |
6 | 1142350101330013503 |
7 | 36411214313332404 |
oct | 3562364752574717 |
9 | 564778344622823 |
10 | 131012200430031 |
11 | 38820a64730848 |
12 | 1283b060a17293 |
13 | 581452239049b |
14 | 244d04aab82ab |
15 | 1022ddbe720a6 |
hex | 7727a7aaf9cf |
131012200430031 has 16 divisors (see below), whose sum is σ = 175048904309760. Its totient is φ = 87158484436800.
The previous prime is 131012200429987. The next prime is 131012200430099. The reversal of 131012200430031 is 130034002210131.
It is not a de Polignac number, because 131012200430031 - 218 = 131012200167887 is a prime.
It is a super-2 number, since 2×1310122004300312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131012200450031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 271928556 + ... + 272409918.
It is an arithmetic number, because the mean of its divisors is an integer number (10940556519360).
Almost surely, 2131012200430031 is an apocalyptic number.
131012200430031 is a deficient number, since it is larger than the sum of its proper divisors (44036703879729).
131012200430031 is a wasteful number, since it uses less digits than its factorization.
131012200430031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 671246.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 131012200430031 its reverse (130034002210131), we get a palindrome (261046202640162).
The spelling of 131012200430031 in words is "one hundred thirty-one trillion, twelve billion, two hundred million, four hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •