Base | Representation |
---|---|
bin | 10000100100010… |
… | …01110111110110 |
3 | 100200111202021100 |
4 | 20102021313312 |
5 | 241034224013 |
6 | 21442430530 |
7 | 3305166024 |
oct | 1022116766 |
9 | 320452240 |
10 | 138976758 |
11 | 714a3328 |
12 | 3a662446 |
13 | 22a3c68b |
14 | 14659714 |
15 | c303473 |
hex | 8489df6 |
138976758 has 24 divisors (see below), whose sum is σ = 311500800. Its totient is φ = 44727984.
The previous prime is 138976753. The next prime is 138976763. The reversal of 138976758 is 857679831.
138976758 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (138976753) and next prime (138976763).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138976753) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 132598 + ... + 133641.
It is an arithmetic number, because the mean of its divisors is an integer number (12979200).
Almost surely, 2138976758 is an apocalyptic number.
138976758 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
138976758 is an abundant number, since it is smaller than the sum of its proper divisors (172524042).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138976758 is a wasteful number, since it uses less digits than its factorization.
138976758 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 266276 (or 266273 counting only the distinct ones).
The product of its digits is 2540160, while the sum is 54.
The square root of 138976758 is about 11788.8404009894. The cubic root of 138976758 is about 517.9812732058.
The spelling of 138976758 in words is "one hundred thirty-eight million, nine hundred seventy-six thousand, seven hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •