Base | Representation |
---|---|
bin | 11101110100010110101010… |
… | …101100110100000010111000 |
3 | 122012022222002202120210101202 |
4 | 131310112222230310002320 |
5 | 114142103433140314000 |
6 | 1142525220110033332 |
7 | 36423426501336545 |
oct | 3564265254640270 |
9 | 565288082523352 |
10 | 131141100323000 |
11 | 388706a0322209 |
12 | 128600351a8848 |
13 | 58237253776c1 |
14 | 2455398017bcc |
15 | 102643342cdd5 |
hex | 7745aab340b8 |
131141100323000 has 32 divisors (see below), whose sum is σ = 306870174758160. Its totient is φ = 52456440128800.
The previous prime is 131141100322993. The next prime is 131141100323053. The reversal of 131141100323000 is 323001141131.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65570549162 + ... + 65570551161.
Almost surely, 2131141100323000 is an apocalyptic number.
131141100323000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131141100323000 is an abundant number, since it is smaller than the sum of its proper divisors (175729074435160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131141100323000 is a wasteful number, since it uses less digits than its factorization.
131141100323000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131141100344 (or 131141100330 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 131141100323000 its reverse (323001141131), we get a palindrome (131464101464131).
The spelling of 131141100323000 in words is "one hundred thirty-one trillion, one hundred forty-one billion, one hundred million, three hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •