Base | Representation |
---|---|
bin | 11101110010111100011110… |
… | …000010000001100101101100 |
3 | 122011222201010011112012210001 |
4 | 131302330132002001211230 |
5 | 114134012111224444112 |
6 | 1142412521533154044 |
7 | 36413430462656551 |
oct | 3562743602014554 |
9 | 564881104465701 |
10 | 131044251015532 |
11 | 38833611422038 |
12 | 1284530662b924 |
13 | 581755c53168a |
14 | 245080b5c8a28 |
15 | 1023b65b01c57 |
hex | 772f1e08196c |
131044251015532 has 6 divisors (see below), whose sum is σ = 229327439277188. Its totient is φ = 65522125507764.
The previous prime is 131044251015529. The next prime is 131044251015533. The reversal of 131044251015532 is 235510152440131.
It is a super-2 number, since 2×1310442510155322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131044251015491 and 131044251015500.
It is not an unprimeable number, because it can be changed into a prime (131044251015533) 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 as a sum of consecutive naturals, namely, 16380531376938 + ... + 16380531376945.
Almost surely, 2131044251015532 is an apocalyptic number.
It is an amenable number.
131044251015532 is a deficient number, since it is larger than the sum of its proper divisors (98283188261656).
131044251015532 is a wasteful number, since it uses less digits than its factorization.
131044251015532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32761062753887 (or 32761062753885 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 37.
The spelling of 131044251015532 in words is "one hundred thirty-one trillion, forty-four billion, two hundred fifty-one million, fifteen thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •