Base | Representation |
---|---|
bin | 11101110100100011111010… |
… | …110111100010010101010000 |
3 | 122012101022211110122010001010 |
4 | 131310203322313202111100 |
5 | 114142322104013310300 |
6 | 1142535532114010520 |
7 | 36424442230403106 |
oct | 3564437267422520 |
9 | 565338743563033 |
10 | 131155330213200 |
11 | 38876732769347 |
12 | 12862946876a40 |
13 | 5824b824a7887 |
14 | 2455d47c53c76 |
15 | 10269b7821a50 |
hex | 7748fade2550 |
131155330213200 has 120 divisors (see below), whose sum is σ = 420167870400256. Its totient is φ = 34971955200000.
The previous prime is 131155330213111. The next prime is 131155330213223. The reversal of 131155330213200 is 2312033551131.
It is a tau number, because it is divible by the number of its divisors (120).
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 23 ways as a sum of consecutive naturals, for example, 10645200 + ... + 19381200.
Almost surely, 2131155330213200 is an apocalyptic number.
131155330213200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131155330213200 is an abundant number, since it is smaller than the sum of its proper divisors (289012540187056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131155330213200 is a wasteful number, since it uses less digits than its factorization.
131155330213200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8748533 (or 8748522 counting only the distinct ones).
The product of its (nonzero) digits is 8100, while the sum is 30.
Adding to 131155330213200 its reverse (2312033551131), we get a palindrome (133467363764331).
The spelling of 131155330213200 in words is "one hundred thirty-one trillion, one hundred fifty-five billion, three hundred thirty million, two hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •