Base | Representation |
---|---|
bin | 11101110101001110100101… |
… | …011110000001000000110011 |
3 | 122012112201002011210002102222 |
4 | 131311032211132001000303 |
5 | 114144044414334200034 |
6 | 1143012550025431255 |
7 | 36430653416123255 |
oct | 3565164536010063 |
9 | 565481064702388 |
10 | 131201142100019 |
11 | 38894101343a32 |
12 | 1286b7b103b52b |
13 | 58292a3671204 |
14 | 2458252263cd5 |
15 | 1027c9968412e |
hex | 7753a5781033 |
131201142100019 has 8 divisors (see below), whose sum is σ = 131497720536000. Its totient is φ = 130904698266216.
The previous prime is 131201142099983. The next prime is 131201142100027. The reversal of 131201142100019 is 910001241102131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131201142100019 - 212 = 131201142095923 is a prime.
It is a super-2 number, since 2×1312011421000192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131201142100069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31698749 + ... + 35597934.
It is an arithmetic number, because the mean of its divisors is an integer number (16437215067000).
Almost surely, 2131201142100019 is an apocalyptic number.
131201142100019 is a deficient number, since it is larger than the sum of its proper divisors (296578435981).
131201142100019 is an equidigital number, since it uses as much as digits as its factorization.
131201142100019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67301089.
The product of its (nonzero) digits is 432, while the sum is 26.
The spelling of 131201142100019 in words is "one hundred thirty-one trillion, two hundred one billion, one hundred forty-two million, one hundred thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •