Base | Representation |
---|---|
bin | 1001010001111… |
… | …1100101010001 |
3 | 2201020200100122 |
4 | 2110133211101 |
5 | 34431123143 |
6 | 3510200025 |
7 | 651604562 |
oct | 224374521 |
9 | 81220318 |
10 | 38926673 |
11 | 1aa78205 |
12 | 11053015 |
13 | 80ac146 |
14 | 5254169 |
15 | 363dc68 |
hex | 251f951 |
38926673 has 4 divisors (see below), whose sum is σ = 39475008. Its totient is φ = 38378340.
The previous prime is 38926663. The next prime is 38926681. The reversal of 38926673 is 37662983.
38926673 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 37662983 = 23 ⋅1637521.
It is not a de Polignac number, because 38926673 - 28 = 38926417 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (38926633) 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, 274061 + ... + 274202.
It is an arithmetic number, because the mean of its divisors is an integer number (9868752).
Almost surely, 238926673 is an apocalyptic number.
It is an amenable number.
38926673 is a deficient number, since it is larger than the sum of its proper divisors (548335).
38926673 is an equidigital number, since it uses as much as digits as its factorization.
38926673 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 548334.
The product of its digits is 326592, while the sum is 44.
The square root of 38926673 is about 6239.1243776671. The cubic root of 38926673 is about 338.9084747536.
The spelling of 38926673 in words is "thirty-eight million, nine hundred twenty-six thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •