Base | Representation |
---|---|
bin | 111101000011101011… |
… | …1111010000001010001 |
3 | 110112102222210210212010 |
4 | 1322013113322001101 |
5 | 4122013233210001 |
6 | 140122533053133 |
7 | 12321165252504 |
oct | 1720727720121 |
9 | 415388723763 |
10 | 131120210001 |
11 | 50675a38520 |
12 | 214b3a871a9 |
13 | c497cb03a1 |
14 | 64bc18913b |
15 | 362638c8d6 |
hex | 1e875fa051 |
131120210001 has 16 divisors (see below), whose sum is σ = 192608630208. Its totient is φ = 78679992000.
The previous prime is 131120209999. The next prime is 131120210003. The reversal of 131120210001 is 100012021131.
It is an interprime number because it is at equal distance from previous prime (131120209999) and next prime (131120210003).
It is not a de Polignac number, because 131120210001 - 21 = 131120209999 is a prime.
It is not an unprimeable number, because it can be changed into a prime (131120210003) 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, 19666666 + ... + 19673331.
It is an arithmetic number, because the mean of its divisors is an integer number (12038039388).
Almost surely, 2131120210001 is an apocalyptic number.
131120210001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
131120210001 is a deficient number, since it is larger than the sum of its proper divisors (61488420207).
131120210001 is a wasteful number, since it uses less digits than its factorization.
131120210001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39340112.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 131120210001 its reverse (100012021131), we get a palindrome (231132231132).
The spelling of 131120210001 in words is "one hundred thirty-one billion, one hundred twenty million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •