Base | Representation |
---|---|
bin | 11101110101001110100100… |
… | …110001000010100101010111 |
3 | 122012112201001100121002112200 |
4 | 131311032210301002211113 |
5 | 114144044403324404400 |
6 | 1143012544525015543 |
7 | 36430653213660045 |
oct | 3565164461024527 |
9 | 565481040532480 |
10 | 131201130309975 |
11 | 388940a57209a0 |
12 | 1286b7a90b45b3 |
13 | 58292a10a395b |
14 | 2458250875395 |
15 | 1027c98605b00 |
hex | 7753a4c42957 |
131201130309975 has 72 divisors (see below), whose sum is σ = 256376205454512. Its totient is φ = 63608414054400.
The previous prime is 131201130309961. The next prime is 131201130310009. The reversal of 131201130309975 is 579903031102131.
131201130309975 is a `hidden beast` number, since 1 + 3 + 1 + 201 + 130 + 309 + 9 + 7 + 5 = 666.
It is not a de Polignac number, because 131201130309975 - 24 = 131201130309959 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 131201130309975.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 35391687 + ... + 38922663.
Almost surely, 2131201130309975 is an apocalyptic number.
131201130309975 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
131201130309975 is a deficient number, since it is larger than the sum of its proper divisors (125175075144537).
131201130309975 is a wasteful number, since it uses less digits than its factorization.
131201130309975 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3546017 (or 3546009 counting only the distinct ones).
The product of its (nonzero) digits is 153090, while the sum is 45.
The spelling of 131201130309975 in words is "one hundred thirty-one trillion, two hundred one billion, one hundred thirty million, three hundred nine thousand, nine hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.501 sec. • engine limits •