Base | Representation |
---|---|
bin | 10000100100001… |
… | …10110111110001 |
3 | 100200111010102001 |
4 | 20102012313301 |
5 | 241033330330 |
6 | 21442254001 |
7 | 3305115133 |
oct | 1022066761 |
9 | 320433361 |
10 | 138964465 |
11 | 71495072 |
12 | 3a657301 |
13 | 22a36bc3 |
14 | 14655053 |
15 | c2ee9ca |
hex | 8486df1 |
138964465 has 8 divisors (see below), whose sum is σ = 166942440. Its totient is φ = 111048192.
The previous prime is 138964453. The next prime is 138964481. The reversal of 138964465 is 564469831.
It can be written as a sum of positive squares in 4 ways, for example, as 7884864 + 131079601 = 2808^2 + 11449^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 138964465 - 27 = 138964337 is a prime.
It is a super-2 number, since 2×1389644652 = 38622245065472450, which contains 22 as substring.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 10314 + ... + 19603.
It is an arithmetic number, because the mean of its divisors is an integer number (20867805).
Almost surely, 2138964465 is an apocalyptic number.
It is an amenable number.
138964465 is a deficient number, since it is larger than the sum of its proper divisors (27977975).
138964465 is an equidigital number, since it uses as much as digits as its factorization.
138964465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30851.
The product of its digits is 622080, while the sum is 46.
The square root of 138964465 is about 11788.3190065420. The cubic root of 138964465 is about 517.9660003126.
The spelling of 138964465 in words is "one hundred thirty-eight million, nine hundred sixty-four thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •