Base | Representation |
---|---|
bin | 10000011101010… |
… | …10000001111101 |
3 | 100121210011120200 |
4 | 20032222001331 |
5 | 240320404101 |
6 | 21411034113 |
7 | 3264330000 |
oct | 1016520175 |
9 | 317704520 |
10 | 138059901 |
11 | 70a274a1 |
12 | 3a29b939 |
13 | 227ab265 |
14 | 1449b537 |
15 | c1c1986 |
hex | 83aa07d |
138059901 has 30 divisors (see below), whose sum is σ = 232679070. Its totient is φ = 78879024.
The previous prime is 138059891. The next prime is 138059927. The reversal of 138059901 is 109950831.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 72692676 + 65367225 = 8526^2 + 8085^2 .
It is not a de Polignac number, because 138059901 - 26 = 138059837 is a prime.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138059101) 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 29 ways as a sum of consecutive naturals, for example, 18415 + ... + 24803.
It is an arithmetic number, because the mean of its divisors is an integer number (7755969).
Almost surely, 2138059901 is an apocalyptic number.
It is an amenable number.
138059901 is a deficient number, since it is larger than the sum of its proper divisors (94619169).
138059901 is an frugal number, since it uses more digits than its factorization.
138059901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6423 (or 6399 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 36.
The square root of 138059901 is about 11749.8894037348. The cubic root of 138059901 is about 516.8396843138.
The spelling of 138059901 in words is "one hundred thirty-eight million, fifty-nine thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •