Base | Representation |
---|---|
bin | 10000101001110… |
… | …10111100010000 |
3 | 100201212121011100 |
4 | 20110322330100 |
5 | 241230431112 |
6 | 21510144400 |
7 | 3314306361 |
oct | 1024727420 |
9 | 321777140 |
10 | 139702032 |
11 | 71949228 |
12 | 3a952100 |
13 | 22c34832 |
14 | 147a7b68 |
15 | c3e82dc |
hex | 853af10 |
139702032 has 60 divisors (see below), whose sum is σ = 394101760. Its totient is φ = 46194624.
The previous prime is 139702007. The next prime is 139702033. The reversal of 139702032 is 230207931.
It is a junction number, because it is equal to n+sod(n) for n = 139701987 and 139702005.
It is not an unprimeable number, because it can be changed into a prime (139702033) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14469 + ... + 22107.
Almost surely, 2139702032 is an apocalyptic number.
139702032 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 139702032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (197050880).
139702032 is an abundant number, since it is smaller than the sum of its proper divisors (254399728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139702032 is a wasteful number, since it uses less digits than its factorization.
139702032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7780 (or 7771 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 27.
The square root of 139702032 is about 11819.5614131828. The cubic root of 139702032 is about 518.8807682714.
Adding to 139702032 its reverse (230207931), we get a palindrome (369909963).
The spelling of 139702032 in words is "one hundred thirty-nine million, seven hundred two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •