Base | Representation |
---|---|
bin | 11101110101011000001001… |
… | …100011010000101001111000 |
3 | 122012120200120211202220200202 |
4 | 131311120021203100221320 |
5 | 114144231432222143000 |
6 | 1143021405022421332 |
7 | 36431466041342144 |
oct | 3565301143205170 |
9 | 565520524686622 |
10 | 131211411131000 |
11 | 388984a09aa9a2 |
12 | 12871798131848 |
13 | 582a24c0053c5 |
14 | 2458948018224 |
15 | 102819ae84dd5 |
hex | 7756098d0a78 |
131211411131000 has 32 divisors (see below), whose sum is σ = 307034702048880. Its totient is φ = 52484564452000.
The previous prime is 131211411130999. The next prime is 131211411131051. The reversal of 131211411131000 is 131114112131.
It is a super-2 number, since 2×1312114111310002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65605704566 + ... + 65605706565.
Almost surely, 2131211411131000 is an apocalyptic number.
131211411131000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131211411131000 is an abundant number, since it is smaller than the sum of its proper divisors (175823290917880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131211411131000 is a wasteful number, since it uses less digits than its factorization.
131211411131000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131211411152 (or 131211411138 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 20.
Adding to 131211411131000 its reverse (131114112131), we get a palindrome (131342525243131).
The spelling of 131211411131000 in words is "one hundred thirty-one trillion, two hundred eleven billion, four hundred eleven million, one hundred thirty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •