Base | Representation |
---|---|
bin | 10000111100000… |
… | …01010101110111 |
3 | 100220100210110121 |
4 | 20132001111313 |
5 | 242333300133 |
6 | 22033232411 |
7 | 3343503253 |
oct | 1036012567 |
9 | 326323417 |
10 | 142087543 |
11 | 73228524 |
12 | 3b702707 |
13 | 2358b590 |
14 | 14c29263 |
15 | c71a02d |
hex | 8781577 |
142087543 has 8 divisors (see below), whose sum is σ = 155173536. Its totient is φ = 129309600.
The previous prime is 142087499. The next prime is 142087549. The reversal of 142087543 is 345780241.
142087543 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 142087543 - 213 = 142079351 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142087499 and 142087508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142087549) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76048 + ... + 77893.
It is an arithmetic number, because the mean of its divisors is an integer number (19396692).
Almost surely, 2142087543 is an apocalyptic number.
142087543 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
142087543 is a deficient number, since it is larger than the sum of its proper divisors (13085993).
142087543 is a wasteful number, since it uses less digits than its factorization.
142087543 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 154025.
The product of its (nonzero) digits is 26880, while the sum is 34.
The square root of 142087543 is about 11920.0479445345. The cubic root of 142087543 is about 521.8175340790.
The spelling of 142087543 in words is "one hundred forty-two million, eighty-seven thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •