Base | Representation |
---|---|
bin | 1001001011100… |
… | …0111111100101 |
3 | 2200110022221112 |
4 | 2102320333211 |
5 | 34324201334 |
6 | 3453154405 |
7 | 645204521 |
oct | 222707745 |
9 | 80408845 |
10 | 38506469 |
11 | 1a810531 |
12 | 10a8ba05 |
13 | 7c92ac1 |
14 | 5184d81 |
15 | 35a94ce |
hex | 24b8fe5 |
38506469 has 2 divisors, whose sum is σ = 38506470. Its totient is φ = 38506468.
The previous prime is 38506463. The next prime is 38506471. The reversal of 38506469 is 96460583.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29833444 + 8673025 = 5462^2 + 2945^2 .
It is a cyclic number.
It is not a de Polignac number, because 38506469 - 28 = 38506213 is a prime.
It is a super-2 number, since 2×385064692 = 2965496309695922, which contains 22 as substring.
Together with 38506471, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (38506463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 19253234 + 19253235.
It is an arithmetic number, because the mean of its divisors is an integer number (19253235).
Almost surely, 238506469 is an apocalyptic number.
It is an amenable number.
38506469 is a deficient number, since it is larger than the sum of its proper divisors (1).
38506469 is an equidigital number, since it uses as much as digits as its factorization.
38506469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 155520, while the sum is 41.
The square root of 38506469 is about 6205.3580879753. The cubic root of 38506469 is about 337.6845819766.
The spelling of 38506469 in words is "thirty-eight million, five hundred six thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •