Base | Representation |
---|---|
bin | 11101100011111011110010… |
… | …110011110010001100100110 |
3 | 122001100002120221201211121000 |
4 | 131203323302303302030212 |
5 | 114020112034312224032 |
6 | 1140303005245334130 |
7 | 36246052512362652 |
oct | 3543736263621446 |
9 | 561302527654530 |
10 | 130012733711142 |
11 | 384760aa833947 |
12 | 126b9409567346 |
13 | 57711c07302c9 |
14 | 241691540ba62 |
15 | 1006de2449e7c |
hex | 763ef2cf2326 |
130012733711142 has 16 divisors (see below), whose sum is σ = 288917186024880. Its totient is φ = 43337577903696.
The previous prime is 130012733711131. The next prime is 130012733711143. The reversal of 130012733711142 is 241117337210031.
130012733711142 is a `hidden beast` number, since 1 + 3 + 0 + 0 + 1 + 273 + 371 + 1 + 14 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 130012733711097 and 130012733711106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130012733711143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1203821608383 + ... + 1203821608490.
It is an arithmetic number, because the mean of its divisors is an integer number (18057324126555).
Almost surely, 2130012733711142 is an apocalyptic number.
130012733711142 is an abundant number, since it is smaller than the sum of its proper divisors (158904452313738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130012733711142 is a wasteful number, since it uses less digits than its factorization.
130012733711142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2407643216884 (or 2407643216878 counting only the distinct ones).
The product of its (nonzero) digits is 21168, while the sum is 36.
The spelling of 130012733711142 in words is "one hundred thirty trillion, twelve billion, seven hundred thirty-three million, seven hundred eleven thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •