Base | Representation |
---|---|
bin | 10000101000010… |
… | …01101111010000 |
3 | 100201111100201001 |
4 | 20110021233100 |
5 | 241203003441 |
6 | 21501551344 |
7 | 3312506662 |
oct | 1024115720 |
9 | 321440631 |
10 | 139500496 |
11 | 71820873 |
12 | 3a875554 |
13 | 22b93b95 |
14 | 14754532 |
15 | c3a8731 |
hex | 8509bd0 |
139500496 has 20 divisors (see below), whose sum is σ = 279001984. Its totient is φ = 67500000.
The previous prime is 139500481. The next prime is 139500509. The reversal of 139500496 is 694005931.
139500496 is an admirable number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 140130 + ... + 141121.
Almost surely, 2139500496 is an apocalyptic number.
139500496 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
139500496 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.
139500496 is a wasteful number, since it uses less digits than its factorization.
139500496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281290 (or 281284 counting only the distinct ones).
The product of its (nonzero) digits is 29160, while the sum is 37.
The square root of 139500496 is about 11811.0328083534. The cubic root of 139500496 is about 518.6311334366.
The spelling of 139500496 in words is "one hundred thirty-nine million, five hundred thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •