Base | Representation |
---|---|
bin | 10000100000011… |
… | …01000010011001 |
3 | 100122112202212101 |
4 | 20100031002121 |
5 | 240421343213 |
6 | 21423443401 |
7 | 3300636211 |
oct | 1020150231 |
9 | 318482771 |
10 | 138465433 |
11 | 71184147 |
12 | 3a456561 |
13 | 228c0a12 |
14 | 14565241 |
15 | c251bdd |
hex | 840d099 |
138465433 has 16 divisors (see below), whose sum is σ = 145530880. Its totient is φ = 131616576.
The previous prime is 138465427. The next prime is 138465443. The reversal of 138465433 is 334564831.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-138465433 is a prime.
It is a super-2 number, since 2×1384654332 = 38345352271754978, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 138465392 and 138465401.
It is not an unprimeable number, because it can be changed into a prime (138465443) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 371035 + ... + 371407.
It is an arithmetic number, because the mean of its divisors is an integer number (9095680).
Almost surely, 2138465433 is an apocalyptic number.
It is an amenable number.
138465433 is a deficient number, since it is larger than the sum of its proper divisors (7065447).
138465433 is a wasteful number, since it uses less digits than its factorization.
138465433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 616.
The product of its digits is 103680, while the sum is 37.
The square root of 138465433 is about 11767.1335931908. The cubic root of 138465433 is about 517.3452381705.
The spelling of 138465433 in words is "one hundred thirty-eight million, four hundred sixty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •