Base | Representation |
---|---|
bin | 11101110011110000011111… |
… | …100000010111100101010000 |
3 | 122012012001022002122222211120 |
4 | 131303300133200113211100 |
5 | 114140421011220301000 |
6 | 1142454320444042240 |
7 | 36420445643151501 |
oct | 3563603740274520 |
9 | 565161262588746 |
10 | 131100110322000 |
11 | 3885527655a826 |
12 | 128540b5833380 |
13 | 581c8c2179241 |
14 | 24533ca182ba8 |
15 | 1025334a8c6a0 |
hex | 773c1f817950 |
131100110322000 has 80 divisors (see below), whose sum is σ = 422666755697472. Its totient is φ = 34960029417600.
The previous prime is 131100110321879. The next prime is 131100110322161. The reversal of 131100110322000 is 223011001131.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10925003194 + ... + 10925015193.
Almost surely, 2131100110322000 is an apocalyptic number.
131100110322000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131100110322000 is an abundant number, since it is smaller than the sum of its proper divisors (291566645375472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131100110322000 is a wasteful number, since it uses less digits than its factorization.
131100110322000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21850018413 (or 21850018397 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 131100110322000 its reverse (223011001131), we get a palindrome (131323121323131).
The spelling of 131100110322000 in words is "one hundred thirty-one trillion, one hundred billion, one hundred ten million, three hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •