Base | Representation |
---|---|
bin | 11101110100010110111000… |
… | …000010001010000101010100 |
3 | 122012022222200100111212212121 |
4 | 131310112320002022011110 |
5 | 114142104412422201400 |
6 | 1142525254220425324 |
7 | 36423435155630530 |
oct | 3564267002120524 |
9 | 565288610455777 |
10 | 131141324022100 |
11 | 388707a56216a7 |
12 | 128600980a8244 |
13 | 582375c80ba32 |
14 | 24553b9a08bc0 |
15 | 1026447db921a |
hex | 7745b808a154 |
131141324022100 has 72 divisors (see below), whose sum is σ = 325243029433280. Its totient is φ = 44961005214720.
The previous prime is 131141324022073. The next prime is 131141324022109. The reversal of 131141324022100 is 1220423141131.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131141324022109) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14611471 + ... + 21812329.
Almost surely, 2131141324022100 is an apocalyptic number.
131141324022100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131141324022100 is an abundant number, since it is smaller than the sum of its proper divisors (194101705411180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131141324022100 is a wasteful number, since it uses less digits than its factorization.
131141324022100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7226897 (or 7226890 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 131141324022100 its reverse (1220423141131), we get a palindrome (132361747163231).
The spelling of 131141324022100 in words is "one hundred thirty-one trillion, one hundred forty-one billion, three hundred twenty-four million, twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •