Base | Representation |
---|---|
bin | 10000101011010… |
… | …10101011011000 |
3 | 100202020112101010 |
4 | 20111222223120 |
5 | 241303210220 |
6 | 21514253520 |
7 | 3316052415 |
oct | 1025525330 |
9 | 322215333 |
10 | 139897560 |
11 | 71a72120 |
12 | 3aa272a0 |
13 | 22ca282a |
14 | 1481910c |
15 | c4361e0 |
hex | 856aad8 |
139897560 has 64 divisors (see below), whose sum is σ = 457850880. Its totient is φ = 33914240.
The previous prime is 139897553. The next prime is 139897567. The reversal of 139897560 is 65798931.
It is an interprime number because it is at equal distance from previous prime (139897553) and next prime (139897567).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139897567) 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 15 ways as a sum of consecutive naturals, for example, 51672 + ... + 54311.
It is an arithmetic number, because the mean of its divisors is an integer number (7153920).
Almost surely, 2139897560 is an apocalyptic number.
139897560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
139897560 is an abundant number, since it is smaller than the sum of its proper divisors (317953320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139897560 is a wasteful number, since it uses less digits than its factorization.
139897560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106008 (or 106004 counting only the distinct ones).
The product of its (nonzero) digits is 408240, while the sum is 48.
The square root of 139897560 is about 11827.8298939408. The cubic root of 139897560 is about 519.1227318789.
The spelling of 139897560 in words is "one hundred thirty-nine million, eight hundred ninety-seven thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •