Base | Representation |
---|---|
bin | 1000001000001110101… |
… | …1101111101110000100 |
3 | 111100110022210102211110 |
4 | 2002003223233232010 |
5 | 4241444422031140 |
6 | 144053054205020 |
7 | 13042420265340 |
oct | 2020353575604 |
9 | 440408712743 |
10 | 139648236420 |
11 | 54251874a40 |
12 | 23093ab3770 |
13 | 10226a3c174 |
14 | 6a8aa22620 |
15 | 3974dda380 |
hex | 2083aefb84 |
139648236420 has 1152 divisors, whose sum is σ = 552930803712. Its totient is φ = 25530163200.
The previous prime is 139648236367. The next prime is 139648236433. The reversal of 139648236420 is 24632846931.
It is a self number, because there is not a number n which added to its sum of digits gives 139648236420.
It is an unprimeable number.
It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 1912989504 + ... + 1912989576.
It is an arithmetic number, because the mean of its divisors is an integer number (479974656).
Almost surely, 2139648236420 is an apocalyptic number.
139648236420 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 139648236420, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (276465401856).
139648236420 is an abundant number, since it is smaller than the sum of its proper divisors (413282567292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139648236420 is a wasteful number, since it uses less digits than its factorization.
139648236420 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 209 (or 188 counting only the distinct ones).
The product of its (nonzero) digits is 1492992, while the sum is 48.
The spelling of 139648236420 in words is "one hundred thirty-nine billion, six hundred forty-eight million, two hundred thirty-six thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •