Base | Representation |
---|---|
bin | 11101110010100110000110… |
… | …010010010100100001000000 |
3 | 122011220102010010100010222112 |
4 | 131302212012102110201000 |
5 | 114133113412430022143 |
6 | 1142353510214154452 |
7 | 36411620306246105 |
oct | 3562460622244100 |
9 | 564812103303875 |
10 | 131020230314048 |
11 | 3882440535a529 |
12 | 12840722052a28 |
13 | 5815201b6784a |
14 | 244d5ad320aac |
15 | 102320bdc1e18 |
hex | 772986494840 |
131020230314048 has 14 divisors (see below), whose sum is σ = 259993269529566. Its totient is φ = 65510115156992.
The previous prime is 131020230314047. The next prime is 131020230314053. The reversal of 131020230314048 is 840413032020131.
It can be written as a sum of positive squares in only one way, i.e., 130780083271744 + 240147042304 = 11435912^2 + 490048^2 .
It is a super-2 number, since 2×1310202303140482 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is not an unprimeable number, because it can be changed into a prime (131020230314047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1023595549265 + ... + 1023595549392.
Almost surely, 2131020230314048 is an apocalyptic number.
It is an amenable number.
131020230314048 is a deficient number, since it is larger than the sum of its proper divisors (128973039215518).
131020230314048 is an equidigital number, since it uses as much as digits as its factorization.
131020230314048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2047191098669 (or 2047191098659 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 32.
Adding to 131020230314048 its reverse (840413032020131), we get a palindrome (971433262334179).
The spelling of 131020230314048 in words is "one hundred thirty-one trillion, twenty billion, two hundred thirty million, three hundred fourteen thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •