Base | Representation |
---|---|
bin | 10000101001110… |
… | …10100010110000 |
3 | 100201212111220220 |
4 | 20110322202300 |
5 | 241230403100 |
6 | 21510133040 |
7 | 3314301540 |
oct | 1024724260 |
9 | 321774826 |
10 | 139700400 |
11 | 71947a84 |
12 | 3a951180 |
13 | 22c33b78 |
14 | 147a7320 |
15 | c3e7aa0 |
hex | 853a8b0 |
139700400 has 120 divisors (see below), whose sum is σ = 511467264. Its totient is φ = 31929600.
The previous prime is 139700387. The next prime is 139700411. The reversal of 139700400 is 4007931.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (24).
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 23 ways as a sum of consecutive naturals, for example, 85 + ... + 16715.
Almost surely, 2139700400 is an apocalyptic number.
139700400 is a gapful number since it is divisible by the number (10) 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 139700400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (255733632).
139700400 is an abundant number, since it is smaller than the sum of its proper divisors (371766864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139700400 is a wasteful number, since it uses less digits than its factorization.
139700400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16659 (or 16648 counting only the distinct ones).
The product of its (nonzero) digits is 756, while the sum is 24.
The square root of 139700400 is about 11819.4923748865. The cubic root of 139700400 is about 518.8787477408.
The spelling of 139700400 in words is "one hundred thirty-nine million, seven hundred thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •