Base | Representation |
---|---|
bin | 100000010011001001101001… |
… | …111010001010000001110100 |
3 | 200121222011222102012022212120 |
4 | 200103021221322022001310 |
5 | 122104401104422413022 |
6 | 1222042253310515540 |
7 | 41631012531346635 |
oct | 4023115172120164 |
9 | 617864872168776 |
10 | 142053525201012 |
11 | 4129861a714847 |
12 | 13b22b12205bb0 |
13 | 6135789165939 |
14 | 27115da74988c |
15 | 1165211597d5c |
hex | 813269e8a074 |
142053525201012 has 48 divisors (see below), whose sum is σ = 334524938932800. Its totient is φ = 46913140189440.
The previous prime is 142053525201001. The next prime is 142053525201017. The reversal of 142053525201012 is 210102525350241.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142053525201017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12792712 + ... + 21160352.
It is an arithmetic number, because the mean of its divisors is an integer number (6969269561100).
Almost surely, 2142053525201012 is an apocalyptic number.
142053525201012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
142053525201012 is an abundant number, since it is smaller than the sum of its proper divisors (192471413731788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142053525201012 is a wasteful number, since it uses less digits than its factorization.
142053525201012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8380736 (or 8380734 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 33.
The spelling of 142053525201012 in words is "one hundred forty-two trillion, fifty-three billion, five hundred twenty-five million, two hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •