Base | Representation |
---|---|
bin | 10000100010001… |
… | …10110000001100 |
3 | 100122222210011001 |
4 | 20101012300030 |
5 | 241001424321 |
6 | 21432510044 |
7 | 3302642350 |
oct | 1021066014 |
9 | 318883131 |
10 | 138701836 |
11 | 71325819 |
12 | 3a54b324 |
13 | 229744c0 |
14 | 145c7460 |
15 | c29bc91 |
hex | 8446c0c |
138701836 has 48 divisors (see below), whose sum is σ = 299751424. Its totient is φ = 54686016.
The previous prime is 138701821. The next prime is 138701851. The reversal of 138701836 is 638107831.
138701836 is digitally balanced in base 3, 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 (138701821) and next prime (138701851).
It is a junction number, because it is equal to n+sod(n) for n = 138701795 and 138701804.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 168121 + ... + 168943.
Almost surely, 2138701836 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 138701836, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (149875712).
138701836 is an abundant number, since it is smaller than the sum of its proper divisors (161049588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138701836 is a wasteful number, since it uses less digits than its factorization.
138701836 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1310 (or 1308 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 37.
The square root of 138701836 is about 11777.1743639975. The cubic root of 138701836 is about 517.6394931513.
The spelling of 138701836 in words is "one hundred thirty-eight million, seven hundred one thousand, eight hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •