Base | Representation |
---|---|
bin | 11101110010100101111111… |
… | …001100000101110000010100 |
3 | 122011220101210211021120101110 |
4 | 131302211333030011300110 |
5 | 114133113141434141322 |
6 | 1142353450322055020 |
7 | 36411614332163055 |
oct | 3562457714056024 |
9 | 564811724246343 |
10 | 131020111240212 |
11 | 388243541205a7 |
12 | 128406aa1aa470 |
13 | 58151b32a635c |
14 | 244d59b5a672c |
15 | 1023201700c0c |
hex | 77297f305c14 |
131020111240212 has 12 divisors (see below), whose sum is σ = 305713592893856. Its totient is φ = 43673370413400.
The previous prime is 131020111240199. The next prime is 131020111240217. The reversal of 131020111240212 is 212042111020131.
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131020111240217) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5459171301664 + ... + 5459171301687.
Almost surely, 2131020111240212 is an apocalyptic number.
131020111240212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131020111240212 is an abundant number, since it is smaller than the sum of its proper divisors (174693481653644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131020111240212 is a wasteful number, since it uses less digits than its factorization.
131020111240212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10918342603358 (or 10918342603356 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 131020111240212 its reverse (212042111020131), we get a palindrome (343062222260343).
The spelling of 131020111240212 in words is "one hundred thirty-one trillion, twenty billion, one hundred eleven million, two hundred forty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •