Base | Representation |
---|---|
bin | 10000101010010… |
… | …01001101011000 |
3 | 100201222120022210 |
4 | 20111021031120 |
5 | 241234313342 |
6 | 21511315120 |
7 | 3314641635 |
oct | 1025111530 |
9 | 321876283 |
10 | 139760472 |
11 | 71989125 |
12 | 3a97baa0 |
13 | 22c55307 |
14 | 147c118c |
15 | c40a79c |
hex | 8549358 |
139760472 has 64 divisors (see below), whose sum is σ = 360430560. Its totient is φ = 45132800.
The previous prime is 139760461. The next prime is 139760501. The reversal of 139760472 is 274067931.
It is a self number, because there is not a number n which added to its sum of digits gives 139760472.
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 15 ways as a sum of consecutive naturals, for example, 169822 + ... + 170642.
Almost surely, 2139760472 is an apocalyptic number.
139760472 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 139760472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (180215280).
139760472 is an abundant number, since it is smaller than the sum of its proper divisors (220670088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139760472 is a wasteful number, since it uses less digits than its factorization.
139760472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1044 (or 1040 counting only the distinct ones).
The product of its (nonzero) digits is 63504, while the sum is 39.
The square root of 139760472 is about 11822.0333276472. The cubic root of 139760472 is about 518.9531107286.
The spelling of 139760472 in words is "one hundred thirty-nine million, seven hundred sixty thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •