Base | Representation |
---|---|
bin | 11101111000110010000101… |
… | …001001000111000100001011 |
3 | 122020102001120211100122201000 |
4 | 131320302011021013010023 |
5 | 114212100201144302442 |
6 | 1143321104500230043 |
7 | 36454421603414433 |
oct | 3570620511070413 |
9 | 566361524318630 |
10 | 131445412884747 |
11 | 38978760886a25 |
12 | 128ab00299b323 |
13 | 58463317a33a0 |
14 | 2465dc5bd32c3 |
15 | 102e2e4502d4c |
hex | 778c8524710b |
131445412884747 has 64 divisors (see below), whose sum is σ = 222489229312000. Its totient is φ = 76028740349184.
The previous prime is 131445412884701. The next prime is 131445412884769. The reversal of 131445412884747 is 747488214544131.
131445412884747 is a `hidden beast` number, since 1 + 3 + 1 + 4 + 4 + 541 + 2 + 8 + 8 + 47 + 47 = 666.
It is not a de Polignac number, because 131445412884747 - 28 = 131445412884491 is a prime.
It is a super-2 number, since 2×1314454128847472 (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 (131445412884547) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 76751122 + ... + 78445047.
It is an arithmetic number, because the mean of its divisors is an integer number (3476394208000).
Almost surely, 2131445412884747 is an apocalyptic number.
131445412884747 is a deficient number, since it is larger than the sum of its proper divisors (91043816427253).
131445412884747 is a wasteful number, since it uses less digits than its factorization.
131445412884747 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155196337 (or 155196331 counting only the distinct ones).
The product of its digits is 96337920, while the sum is 63.
The spelling of 131445412884747 in words is "one hundred thirty-one trillion, four hundred forty-five billion, four hundred twelve million, eight hundred eighty-four thousand, seven hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •