Base | Representation |
---|---|
bin | 1000000110111001000… |
… | …0010101000100100100 |
3 | 111022112021022111210000 |
4 | 2001232100111010210 |
5 | 4240230403242334 |
6 | 143553252501300 |
7 | 13030463436360 |
oct | 2015620250444 |
9 | 438467274700 |
10 | 139288727844 |
11 | 54087945912 |
12 | 22bb361a830 |
13 | 1019a406cb6 |
14 | 6a54d9c2a0 |
15 | 3953574299 |
hex | 206e415124 |
139288727844 has 480 divisors, whose sum is σ = 453178880000. Its totient is φ = 36415754496.
The previous prime is 139288727827. The next prime is 139288727869. The reversal of 139288727844 is 448727882931.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is an unprimeable number.
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 159 ways as a sum of consecutive naturals, for example, 317286177 + ... + 317286615.
Almost surely, 2139288727844 is an apocalyptic number.
139288727844 is a gapful number since it is divisible by the number (14) 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 139288727844, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (226589440000).
139288727844 is an abundant number, since it is smaller than the sum of its proper divisors (313890152156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139288727844 is a wasteful number, since it uses less digits than its factorization.
139288727844 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 717 (or 706 counting only the distinct ones).
The product of its digits is 43352064, while the sum is 63.
The spelling of 139288727844 in words is "one hundred thirty-nine billion, two hundred eighty-eight million, seven hundred twenty-seven thousand, eight hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •