Base | Representation |
---|---|
bin | 11101110100000100001110… |
… | …101010010001000011101000 |
3 | 122012021002000000120020102210 |
4 | 131310010032222101003220 |
5 | 114141242411422244040 |
6 | 1142512143402525120 |
7 | 36422126053064235 |
oct | 3564041652210350 |
9 | 565232000506383 |
10 | 131121302540520 |
11 | 38863260a60206 |
12 | 1285822ab067a0 |
13 | 58218bb852506 |
14 | 245443a93078c |
15 | 1025b75308480 |
hex | 77410ea910e8 |
131121302540520 has 64 divisors (see below), whose sum is σ = 393367086216000. Its totient is φ = 34965398135808.
The previous prime is 131121302540489. The next prime is 131121302540531. The reversal of 131121302540520 is 25045203121131.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 10712736 + ... + 19416624.
It is an arithmetic number, because the mean of its divisors is an integer number (6146360722125).
Almost surely, 2131121302540520 is an apocalyptic number.
131121302540520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131121302540520 is an abundant number, since it is smaller than the sum of its proper divisors (262245783675480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131121302540520 is a wasteful number, since it uses less digits than its factorization.
131121302540520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8829442 (or 8829438 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 131121302540520 its reverse (25045203121131), we get a palindrome (156166505661651).
The spelling of 131121302540520 in words is "one hundred thirty-one trillion, one hundred twenty-one billion, three hundred two million, five hundred forty thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •