Base | Representation |
---|---|
bin | 11101110100010110101011… |
… | …010110010011101001001100 |
3 | 122012022222010112001102021220 |
4 | 131310112223112103221030 |
5 | 114142103443431402312 |
6 | 1142525221135123340 |
7 | 36423426662652102 |
oct | 3564265326235114 |
9 | 565288115042256 |
10 | 131141111200332 |
11 | 388706a6481542 |
12 | 12860038973550 |
13 | 58237276b56ac |
14 | 2455399649c72 |
15 | 102643437ac8c |
hex | 7745ab593a4c |
131141111200332 has 12 divisors (see below), whose sum is σ = 305995926134136. Its totient is φ = 43713703733440.
The previous prime is 131141111200283. The next prime is 131141111200357. The reversal of 131141111200332 is 233002111141131.
It is a tau number, because it is divible by the number of its divisors (12).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5464212966669 + ... + 5464212966692.
It is an arithmetic number, because the mean of its divisors is an integer number (25499660511178).
Almost surely, 2131141111200332 is an apocalyptic number.
131141111200332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131141111200332 is an abundant number, since it is smaller than the sum of its proper divisors (174854814933804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131141111200332 is a wasteful number, since it uses less digits than its factorization.
131141111200332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10928425933368 (or 10928425933366 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 24.
Adding to 131141111200332 its reverse (233002111141131), we get a palindrome (364143222341463).
The spelling of 131141111200332 in words is "one hundred thirty-one trillion, one hundred forty-one billion, one hundred eleven million, two hundred thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.993 sec. • engine limits •