Base | Representation |
---|---|
bin | 10000101011101… |
… | …10011110010000 |
3 | 100202022222122110 |
4 | 20111312132100 |
5 | 241311231442 |
6 | 21515305320 |
7 | 3316343313 |
oct | 1025663620 |
9 | 322288573 |
10 | 139945872 |
11 | 71aa5450 |
12 | 3aa4b240 |
13 | 22cbb811 |
14 | 1482c97a |
15 | c44569c |
hex | 8576790 |
139945872 has 80 divisors (see below), whose sum is σ = 397688832. Its totient is φ = 42053760.
The previous prime is 139945847. The next prime is 139945879. The reversal of 139945872 is 278549931.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (139945879) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 66013 + ... + 68099.
Almost surely, 2139945872 is an apocalyptic number.
139945872 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 139945872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (198844416).
139945872 is an abundant number, since it is smaller than the sum of its proper divisors (257742960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139945872 is a wasteful number, since it uses less digits than its factorization.
139945872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2236 (or 2230 counting only the distinct ones).
The product of its digits is 544320, while the sum is 48.
The square root of 139945872 is about 11829.8720195951. The cubic root of 139945872 is about 519.1824826731.
The spelling of 139945872 in words is "one hundred thirty-nine million, nine hundred forty-five thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •