Base | Representation |
---|---|
bin | 10000011110111… |
… | …01011111001101 |
3 | 100122011212200220 |
4 | 20033131133031 |
5 | 240344130134 |
6 | 21415341553 |
7 | 3266165325 |
oct | 1017353715 |
9 | 318155626 |
10 | 138270669 |
11 | 71060889 |
12 | 3a3818b9 |
13 | 22853184 |
14 | 14514285 |
15 | c214149 |
hex | 83dd7cd |
138270669 has 8 divisors (see below), whose sum is σ = 184566912. Its totient is φ = 92077440.
The previous prime is 138270607. The next prime is 138270679. The reversal of 138270669 is 966072831.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 138270669 - 213 = 138262477 is a prime.
It is a super-2 number, since 2×1382706692 = 38237555811415122, which contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 138270669.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138270679) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22564 + ... + 28029.
It is an arithmetic number, because the mean of its divisors is an integer number (23070864).
Almost surely, 2138270669 is an apocalyptic number.
It is an amenable number.
138270669 is a deficient number, since it is larger than the sum of its proper divisors (46296243).
138270669 is an equidigital number, since it uses as much as digits as its factorization.
138270669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51507.
The product of its (nonzero) digits is 108864, while the sum is 42.
The square root of 138270669 is about 11758.8549187410. The cubic root of 138270669 is about 517.1025602557.
The spelling of 138270669 in words is "one hundred thirty-eight million, two hundred seventy thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •