Base | Representation |
---|---|
bin | 1000010010011111010… |
… | …0111110110101011100 |
3 | 111121120020201021100120 |
4 | 2010213310332311130 |
5 | 4313114420333202 |
6 | 145230231354540 |
7 | 13200600025452 |
oct | 2044764766534 |
9 | 447506637316 |
10 | 142402121052 |
11 | 55435315254 |
12 | 23722222a50 |
13 | 105754411b9 |
14 | 6c6c6809d2 |
15 | 3a86a660bc |
hex | 2127d3ed5c |
142402121052 has 96 divisors (see below), whose sum is σ = 356297356800. Its totient is φ = 44109711360.
The previous prime is 142402121047. The next prime is 142402121089. The reversal of 142402121052 is 250121204241.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5304688 + ... + 5331464.
It is an arithmetic number, because the mean of its divisors is an integer number (3711430800).
Almost surely, 2142402121052 is an apocalyptic number.
142402121052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 142402121052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (178148678400).
142402121052 is an abundant number, since it is smaller than the sum of its proper divisors (213895235748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142402121052 is a wasteful number, since it uses less digits than its factorization.
142402121052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27131 (or 27129 counting only the distinct ones).
The product of its (nonzero) digits is 1280, while the sum is 24.
Adding to 142402121052 its reverse (250121204241), we get a palindrome (392523325293).
The spelling of 142402121052 in words is "one hundred forty-two billion, four hundred two million, one hundred twenty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •