Base | Representation |
---|---|
bin | 11101110011110011011001… |
… | …001001111100001111111100 |
3 | 122012012100100011111021202010 |
4 | 131303303121021330033330 |
5 | 114140443401100130202 |
6 | 1142455553510331220 |
7 | 36420616063422216 |
oct | 3563633111741774 |
9 | 565170304437663 |
10 | 131103225005052 |
11 | 38856624730253 |
12 | 12854824959b10 |
13 | 581cc9a545571 |
14 | 2453603abd5b6 |
15 | 102546823676c |
hex | 773cd927c3fc |
131103225005052 has 96 divisors (see below), whose sum is σ = 322578457062400. Its totient is φ = 41327714598912.
The previous prime is 131103225005021. The next prime is 131103225005057. The reversal of 131103225005052 is 250500522301131.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131103225005057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 374509533 + ... + 374859435.
Almost surely, 2131103225005052 is an apocalyptic number.
131103225005052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131103225005052 is an abundant number, since it is smaller than the sum of its proper divisors (191475232057348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131103225005052 is a wasteful number, since it uses less digits than its factorization.
131103225005052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352835 (or 352833 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 30.
Adding to 131103225005052 its reverse (250500522301131), we get a palindrome (381603747306183).
The spelling of 131103225005052 in words is "one hundred thirty-one trillion, one hundred three billion, two hundred twenty-five million, five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •