Base | Representation |
---|---|
bin | 10000101010101… |
… | …10110001110010 |
3 | 100202002101120020 |
4 | 20111112301302 |
5 | 241243103200 |
6 | 21512424310 |
7 | 3315262653 |
oct | 1025266162 |
9 | 322071506 |
10 | 139816050 |
11 | 71a16960 |
12 | 3a9a8096 |
13 | 22c746ba |
14 | 147d752a |
15 | c41bea0 |
hex | 8556c72 |
139816050 has 48 divisors (see below), whose sum is σ = 378270432. Its totient is φ = 33894400.
The previous prime is 139816049. The next prime is 139816051. The reversal of 139816050 is 50618931.
It is an interprime number because it is at equal distance from previous prime (139816049) and next prime (139816051).
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (139816051) 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 23 ways as a sum of consecutive naturals, for example, 40719 + ... + 44018.
It is an arithmetic number, because the mean of its divisors is an integer number (7880634).
Almost surely, 2139816050 is an apocalyptic number.
139816050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
139816050 is an abundant number, since it is smaller than the sum of its proper divisors (238454382).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139816050 is a wasteful number, since it uses less digits than its factorization.
139816050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84763 (or 84758 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 33.
The square root of 139816050 is about 11824.3837048702. The cubic root of 139816050 is about 519.0218916297.
The spelling of 139816050 in words is "one hundred thirty-nine million, eight hundred sixteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •