Base | Representation |
---|---|
bin | 10001000000101… |
… | …00110011010000 |
3 | 100221111110222201 |
4 | 20200110303100 |
5 | 243012112121 |
6 | 22054212544 |
7 | 3351600211 |
oct | 1040246320 |
9 | 327443881 |
10 | 142691536 |
11 | 73600299 |
12 | 3b954154 |
13 | 23740480 |
14 | 14d45408 |
15 | c7d8e91 |
hex | 8814cd0 |
142691536 has 40 divisors (see below), whose sum is σ = 305794664. Its totient is φ = 64074240.
The previous prime is 142691509. The next prime is 142691537. The reversal of 142691536 is 635196241.
It can be written as a sum of positive squares in 4 ways, for example, as 22657600 + 120033936 = 4760^2 + 10956^2 .
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a junction number, because it is equal to n+sod(n) for n = 142691495 and 142691504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142691537) 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, 1575 + ... + 16966.
Almost surely, 2142691536 is an apocalyptic number.
142691536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
142691536 is an abundant number, since it is smaller than the sum of its proper divisors (163103128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142691536 is a wasteful number, since it uses less digits than its factorization.
142691536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18599 (or 18593 counting only the distinct ones).
The product of its digits is 38880, while the sum is 37.
The square root of 142691536 is about 11945.3562525360. The cubic root of 142691536 is about 522.5558784283. Note that the first 3 decimals are identical.
The spelling of 142691536 in words is "one hundred forty-two million, six hundred ninety-one thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •