Base | Representation |
---|---|
bin | 10000011111101… |
… | …10011010100001 |
3 | 100122101001202101 |
4 | 20033312122201 |
5 | 240410412034 |
6 | 21421450401 |
7 | 3300102103 |
oct | 1017663241 |
9 | 318331671 |
10 | 138372769 |
11 | 71120567 |
12 | 3a410a01 |
13 | 2288a7a2 |
14 | 1453d573 |
15 | c234514 |
hex | 83f66a1 |
138372769 has 2 divisors, whose sum is σ = 138372770. Its totient is φ = 138372768.
The previous prime is 138372757. The next prime is 138372781. The reversal of 138372769 is 967273831.
It is a happy number.
138372769 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (138372757) and next prime (138372781).
It can be written as a sum of positive squares in only one way, i.e., 114490000 + 23882769 = 10700^2 + 4887^2 .
It is a cyclic number.
It is not a de Polignac number, because 138372769 - 25 = 138372737 is a prime.
It is a super-2 number, since 2×1383727692 = 38294046401454722, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (138372709) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69186384 + 69186385.
It is an arithmetic number, because the mean of its divisors is an integer number (69186385).
Almost surely, 2138372769 is an apocalyptic number.
It is an amenable number.
138372769 is a deficient number, since it is larger than the sum of its proper divisors (1).
138372769 is an equidigital number, since it uses as much as digits as its factorization.
138372769 is an evil number, because the sum of its binary digits is even.
The product of its digits is 381024, while the sum is 46.
The square root of 138372769 is about 11763.1955267266. The cubic root of 138372769 is about 517.2298062872.
The spelling of 138372769 in words is "one hundred thirty-eight million, three hundred seventy-two thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •