Base | Representation |
---|---|
bin | 10000100101000… |
… | …00100011010010 |
3 | 100200200110200210 |
4 | 20102200203102 |
5 | 241100212100 |
6 | 21444424550 |
7 | 3306033606 |
oct | 1022404322 |
9 | 320613623 |
10 | 139069650 |
11 | 715570a5 |
12 | 3a6a8156 |
13 | 22a72a45 |
14 | 14681506 |
15 | c320c50 |
hex | 84a08d2 |
139069650 has 48 divisors (see below), whose sum is σ = 346058208. Its totient is φ = 36960000.
The previous prime is 139069649. The next prime is 139069669. The reversal of 139069650 is 56960931.
It is a super-2 number, since 2×1390696502 = 38680735102245000, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 139069599 and 139069608.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 48250 + ... + 51050.
It is an arithmetic number, because the mean of its divisors is an integer number (7209546).
Almost surely, 2139069650 is an apocalyptic number.
139069650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 139069650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (173029104).
139069650 is an abundant number, since it is smaller than the sum of its proper divisors (206988558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139069650 is a wasteful number, since it uses less digits than its factorization.
139069650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3147 (or 3142 counting only the distinct ones).
The product of its (nonzero) digits is 43740, while the sum is 39.
The square root of 139069650 is about 11792.7795705677. The cubic root of 139069650 is about 518.0966536497.
The spelling of 139069650 in words is "one hundred thirty-nine million, sixty-nine thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •