Base | Representation |
---|---|
bin | 1000010001000010100… |
… | …0101001101001000110 |
3 | 111120120010112111211120 |
4 | 2010100220221221012 |
5 | 4311320312400200 |
6 | 145123451414410 |
7 | 13155133455363 |
oct | 2042050515106 |
9 | 446503474746 |
10 | 142013012550 |
11 | 55255709282 |
12 | 23633a54406 |
13 | 10512944196 |
14 | 6c32b1346a |
15 | 3a628049a0 |
hex | 2110a29a46 |
142013012550 has 24 divisors (see below), whose sum is σ = 352192271496. Its totient is φ = 37870136640.
The previous prime is 142013012503. The next prime is 142013012569. The reversal of 142013012550 is 55210310241.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 142013012550.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 473376559 + ... + 473376858.
It is an arithmetic number, because the mean of its divisors is an integer number (14674677979).
Almost surely, 2142013012550 is an apocalyptic number.
142013012550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
142013012550 is an abundant number, since it is smaller than the sum of its proper divisors (210179258946).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142013012550 is a wasteful number, since it uses less digits than its factorization.
142013012550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 946753432 (or 946753427 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
Adding to 142013012550 its reverse (55210310241), we get a palindrome (197223322791).
The spelling of 142013012550 in words is "one hundred forty-two billion, thirteen million, twelve thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •