Base | Representation |
---|---|
bin | 11101110010010011010110… |
… | …101010100110100010110000 |
3 | 122011211111011111011111001210 |
4 | 131302103112222212202300 |
5 | 114132301203112121034 |
6 | 1142340341134000120 |
7 | 36410305461465312 |
oct | 3562232652464260 |
9 | 564744144144053 |
10 | 131000104020144 |
11 | 3881691760aa87 |
12 | 12838845946040 |
13 | 58133452712b8 |
14 | 244c6203617b2 |
15 | 102293000a8e9 |
hex | 7724d6aa68b0 |
131000104020144 has 40 divisors (see below), whose sum is σ = 353130715187712. Its totient is φ = 41768149107520.
The previous prime is 131000104020089. The next prime is 131000104020151. The reversal of 131000104020144 is 441020401000131.
It is a super-2 number, since 2×1310001040201442 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 131000104020144.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59329756152 + ... + 59329758359.
Almost surely, 2131000104020144 is an apocalyptic number.
It is an amenable number.
131000104020144 is an abundant number, since it is smaller than the sum of its proper divisors (222130611167568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131000104020144 is a wasteful number, since it uses less digits than its factorization.
131000104020144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118659514545 (or 118659514539 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 131000104020144 its reverse (441020401000131), we get a palindrome (572020505020275).
The spelling of 131000104020144 in words is "one hundred thirty-one trillion, one hundred four million, twenty thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •