Base | Representation |
---|---|
bin | 11101110011000010110000… |
… | …011000101101111101000100 |
3 | 122012000100112121120112122010 |
4 | 131303002300120231331010 |
5 | 114134114422324432002 |
6 | 1142415555433334220 |
7 | 36414056661226215 |
oct | 3563026030557504 |
9 | 565010477515563 |
10 | 131051001405252 |
11 | 38836465889815 |
12 | 1284668b267370 |
13 | 5818096c00416 |
14 | 2450c8bd2b40c |
15 | 1023e0d56246c |
hex | 7730b062df44 |
131051001405252 has 12 divisors (see below), whose sum is σ = 305785669945616. Its totient is φ = 43683667135080.
The previous prime is 131051001405227. The next prime is 131051001405293. The reversal of 131051001405252 is 252504100150131.
It is a tau number, because it is divible by the number of its divisors (12).
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 3 ways as a sum of consecutive naturals, for example, 5460458391874 + ... + 5460458391897.
Almost surely, 2131051001405252 is an apocalyptic number.
131051001405252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131051001405252 is an abundant number, since it is smaller than the sum of its proper divisors (174734668540364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131051001405252 is a wasteful number, since it uses less digits than its factorization.
131051001405252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10920916783778 (or 10920916783776 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 30.
Adding to 131051001405252 its reverse (252504100150131), we get a palindrome (383555101555383).
The spelling of 131051001405252 in words is "one hundred thirty-one trillion, fifty-one billion, one million, four hundred five thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •