Base | Representation |
---|---|
bin | 11101110110111110010100… |
… | …001110111010010110101000 |
3 | 122012222011202002100002012202 |
4 | 131312332110032322112220 |
5 | 114203031114133342300 |
6 | 1143144030325155332 |
7 | 36442431401423135 |
oct | 3566762416722650 |
9 | 565864662302182 |
10 | 131321112012200 |
11 | 3892aa75218690 |
12 | 1288aab285bb48 |
13 | 58376b2552626 |
14 | 245dd935b758c |
15 | 102ae6bb94ad5 |
hex | 776f943ba5a8 |
131321112012200 has 48 divisors (see below), whose sum is σ = 333078093200160. Its totient is φ = 47753131640000.
The previous prime is 131321112012169. The next prime is 131321112012217. The reversal of 131321112012200 is 2210211123131.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 29845705076 + ... + 29845709475.
It is an arithmetic number, because the mean of its divisors is an integer number (6939126941670).
Almost surely, 2131321112012200 is an apocalyptic number.
131321112012200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131321112012200 is an abundant number, since it is smaller than the sum of its proper divisors (201756981187960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131321112012200 is a wasteful number, since it uses less digits than its factorization.
131321112012200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59691414578 (or 59691414569 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 131321112012200 its reverse (2210211123131), we get a palindrome (133531323135331).
The spelling of 131321112012200 in words is "one hundred thirty-one trillion, three hundred twenty-one billion, one hundred twelve million, twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •