Base | Representation |
---|---|
bin | 11101111101001000111010… |
… | …010101110011101000101001 |
3 | 122021110200101000122002001010 |
4 | 131331020322111303220221 |
5 | 114232001330220220203 |
6 | 1144110421142014133 |
7 | 36515151045654411 |
oct | 3575107225635051 |
9 | 567420330562033 |
10 | 131744805632553 |
11 | 38a83727221703 |
12 | 12939038a17349 |
13 | 5868635867469 |
14 | 24766a8421641 |
15 | 1036eb8710303 |
hex | 77d23a573a29 |
131744805632553 has 32 divisors (see below), whose sum is σ = 182133833610240. Its totient is φ = 84606733440320.
The previous prime is 131744805632527. The next prime is 131744805632567. The reversal of 131744805632553 is 355236508447131.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131744805632553 is a prime.
It is a super-2 number, since 2×1317448056325532 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131744805632493 and 131744805632502.
It is not an unprimeable number, because it can be changed into a prime (131744805632053) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1554817198 + ... + 1554901928.
It is an arithmetic number, because the mean of its divisors is an integer number (5691682300320).
Almost surely, 2131744805632553 is an apocalyptic number.
It is an amenable number.
131744805632553 is a deficient number, since it is larger than the sum of its proper divisors (50389027977687).
131744805632553 is a wasteful number, since it uses less digits than its factorization.
131744805632553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 125549.
The product of its (nonzero) digits is 36288000, while the sum is 57.
The spelling of 131744805632553 in words is "one hundred thirty-one trillion, seven hundred forty-four billion, eight hundred five million, six hundred thirty-two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •