Base | Representation |
---|---|
bin | 10000100000010… |
… | …01011010111111 |
3 | 100122112000112212 |
4 | 20100021122333 |
5 | 240420404443 |
6 | 21423251035 |
7 | 3300545063 |
oct | 1020113277 |
9 | 318460485 |
10 | 138450623 |
11 | 71174003 |
12 | 3a449a7b |
13 | 228b705c |
14 | 1455daa3 |
15 | c24c618 |
hex | 84096bf |
138450623 has 4 divisors (see below), whose sum is σ = 138704280. Its totient is φ = 138196968.
The previous prime is 138450577. The next prime is 138450647. The reversal of 138450623 is 326054831.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 326054831 = 23 ⋅14176297.
It is a cyclic number.
It is not a de Polignac number, because 138450623 - 214 = 138434239 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 138450623.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138450223) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 126008 + ... + 127101.
It is an arithmetic number, because the mean of its divisors is an integer number (34676070).
Almost surely, 2138450623 is an apocalyptic number.
138450623 is a deficient number, since it is larger than the sum of its proper divisors (253657).
138450623 is an equidigital number, since it uses as much as digits as its factorization.
138450623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253656.
The product of its (nonzero) digits is 17280, while the sum is 32.
The square root of 138450623 is about 11766.5042812213. The cubic root of 138450623 is about 517.3267927579.
The spelling of 138450623 in words is "one hundred thirty-eight million, four hundred fifty thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •