Base | Representation |
---|---|
bin | 10000100110111… |
… | …10000010111100 |
3 | 100201011021012202 |
4 | 20103132002330 |
5 | 241131242112 |
6 | 21454051032 |
7 | 3311133140 |
oct | 1023360274 |
9 | 321137182 |
10 | 139321532 |
11 | 71709369 |
12 | 3a7a9a78 |
13 | 22b3059c |
14 | 14709220 |
15 | c3706c2 |
hex | 84de0bc |
139321532 has 12 divisors (see below), whose sum is σ = 278643120. Its totient is φ = 59709216.
The previous prime is 139321531. The next prime is 139321543. The reversal of 139321532 is 235123931.
139321532 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 139321495 and 139321504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139321531) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 2487857 + ... + 2487912.
It is an arithmetic number, because the mean of its divisors is an integer number (23220260).
Almost surely, 2139321532 is an apocalyptic number.
It is an amenable number.
139321532 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139321532 is a wasteful number, since it uses less digits than its factorization.
139321532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4975780 (or 4975778 counting only the distinct ones).
The product of its digits is 4860, while the sum is 29.
The square root of 139321532 is about 11803.4542401790. The cubic root of 139321532 is about 518.4092560377.
The spelling of 139321532 in words is "one hundred thirty-nine million, three hundred twenty-one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •