Base | Representation |
---|---|
bin | 111101000000000110… |
… | …1110011011011000111 |
3 | 110112010121211122202111 |
4 | 1322000031303123013 |
5 | 4121242012333111 |
6 | 140103003121451 |
7 | 12315206441053 |
oct | 1720015633307 |
9 | 415117748674 |
10 | 131000121031 |
11 | 5061417593a |
12 | 2147b813287 |
13 | c479154b20 |
14 | 64aa248c63 |
15 | 361aa6aa21 |
hex | 1e803736c7 |
131000121031 has 16 divisors (see below), whose sum is σ = 142145740800. Its totient is φ = 120007657728.
The previous prime is 131000120989. The next prime is 131000121053. The reversal of 131000121031 is 130121000131.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131000121031 is a prime.
It is a super-2 number, since 2×1310001210312 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131000125031) 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, 8521530 + ... + 8536888.
It is an arithmetic number, because the mean of its divisors is an integer number (8884108800).
Almost surely, 2131000121031 is an apocalyptic number.
131000121031 is a deficient number, since it is larger than the sum of its proper divisors (11145619769).
131000121031 is a wasteful number, since it uses less digits than its factorization.
131000121031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20298.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 131000121031 its reverse (130121000131), we get a palindrome (261121121162).
The spelling of 131000121031 in words is "one hundred thirty-one billion, one hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •