Base | Representation |
---|---|
bin | 11101110011111110100000… |
… | …010000100001011110111000 |
3 | 122012020111010121111122021010 |
4 | 131303332200100201132320 |
5 | 114141142314231043000 |
6 | 1142505245410513520 |
7 | 36421520530500501 |
oct | 3563764020413670 |
9 | 565214117448233 |
10 | 131115155331000 |
11 | 38860697023765 |
12 | 12856bb42958a0 |
13 | 582114c123a29 |
14 | 2454016361ba8 |
15 | 10259157e2d50 |
hex | 773fa04217b8 |
131115155331000 has 128 divisors (see below), whose sum is σ = 430609773484800. Its totient is φ = 33123828700800.
The previous prime is 131115155330993. The next prime is 131115155331053. The reversal of 131115155331000 is 133551511131.
It is a super-2 number, since 2×1311151553310002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1150075942 + ... + 1150189941.
It is an arithmetic number, because the mean of its divisors is an integer number (3364138855350).
Almost surely, 2131115155331000 is an apocalyptic number.
131115155331000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131115155331000 is an abundant number, since it is smaller than the sum of its proper divisors (299494618153800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131115155331000 is a wasteful number, since it uses less digits than its factorization.
131115155331000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2300265926 (or 2300265912 counting only the distinct ones).
The product of its (nonzero) digits is 3375, while the sum is 30.
The spelling of 131115155331000 in words is "one hundred thirty-one trillion, one hundred fifteen billion, one hundred fifty-five million, three hundred thirty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •