Base | Representation |
---|---|
bin | 1001001111010… |
… | …0001101101001 |
3 | 2200220122200101 |
4 | 2103310031221 |
5 | 34404432113 |
6 | 3502305401 |
7 | 650234641 |
oct | 223641551 |
9 | 80818611 |
10 | 38749033 |
11 | 1a9667a4 |
12 | 10b88261 |
13 | 804932b |
14 | 5209521 |
15 | 36062dd |
hex | 24f4369 |
38749033 has 2 divisors, whose sum is σ = 38749034. Its totient is φ = 38749032.
The previous prime is 38749019. The next prime is 38749049. The reversal of 38749033 is 33094783.
38749033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 33605209 + 5143824 = 5797^2 + 2268^2 .
It is an emirp because it is prime and its reverse (33094783) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 38749033 - 217 = 38617961 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 38748983 and 38749001.
It is not a weakly prime, because it can be changed into another prime (38719033) 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 as a sum of consecutive naturals, namely, 19374516 + 19374517.
It is an arithmetic number, because the mean of its divisors is an integer number (19374517).
Almost surely, 238749033 is an apocalyptic number.
It is an amenable number.
38749033 is a deficient number, since it is larger than the sum of its proper divisors (1).
38749033 is an equidigital number, since it uses as much as digits as its factorization.
38749033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54432, while the sum is 37.
The square root of 38749033 is about 6224.8721272007. The cubic root of 38749033 is about 338.3921577179.
The spelling of 38749033 in words is "thirty-eight million, seven hundred forty-nine thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •