Base | Representation |
---|---|
bin | 11101110010111100011110… |
… | …000001111110011010101100 |
3 | 122011222201010011111112221212 |
4 | 131302330132001332122230 |
5 | 114134012111224040130 |
6 | 1142412521533013552 |
7 | 36413430462603641 |
oct | 3562743601763254 |
9 | 564881104445855 |
10 | 131044251002540 |
11 | 388336114132a7 |
12 | 128453066242b8 |
13 | 581755c5287a5 |
14 | 245080b5c3dc8 |
15 | 1023b65aece95 |
hex | 772f1e07e6ac |
131044251002540 has 48 divisors (see below), whose sum is σ = 278063829136800. Its totient is φ = 51870993549312.
The previous prime is 131044251002387. The next prime is 131044251002573. The reversal of 131044251002540 is 45200152440131.
It is a junction number, because it is equal to n+sod(n) for n = 131044251002497 and 131044251002506.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11835566 + ... + 20054154.
It is an arithmetic number, because the mean of its divisors is an integer number (5792996440350).
Almost surely, 2131044251002540 is an apocalyptic number.
131044251002540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131044251002540 is an abundant number, since it is smaller than the sum of its proper divisors (147019578134260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131044251002540 is a wasteful number, since it uses less digits than its factorization.
131044251002540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8226914 (or 8226912 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 32.
The spelling of 131044251002540 in words is "one hundred thirty-one trillion, forty-four billion, two hundred fifty-one million, two thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •