Base | Representation |
---|---|
bin | 10000111111011… |
… | …11100100100101 |
3 | 100221012201210220 |
4 | 20133233210211 |
5 | 242442222140 |
6 | 22051034553 |
7 | 3350363505 |
oct | 1037574445 |
9 | 327181726 |
10 | 142539045 |
11 | 73506770 |
12 | 3b89ba59 |
13 | 236b8c3c |
14 | 14d05a05 |
15 | c7a8bd0 |
hex | 87ef925 |
142539045 has 48 divisors (see below), whose sum is σ = 262688832. Its totient is φ = 65445120.
The previous prime is 142539043. The next prime is 142539053. The reversal of 142539045 is 540935241.
It is not a de Polignac number, because 142539045 - 21 = 142539043 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 142538997 and 142539015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142539041) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 58369 + ... + 60761.
It is an arithmetic number, because the mean of its divisors is an integer number (5472684).
Almost surely, 2142539045 is an apocalyptic number.
142539045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
142539045 is a deficient number, since it is larger than the sum of its proper divisors (120149787).
142539045 is a wasteful number, since it uses less digits than its factorization.
142539045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2450 (or 2431 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
The square root of 142539045 is about 11938.9716893877. The cubic root of 142539045 is about 522.3696644607.
It can be divided in two parts, 1425 and 39045, that added together give a triangular number (40470 = T284).
The spelling of 142539045 in words is "one hundred forty-two million, five hundred thirty-nine thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •