Base | Representation |
---|---|
bin | 1001000110000… |
… | …1110100110111 |
3 | 2122210012011220 |
4 | 2101201310313 |
5 | 34231240211 |
6 | 3441401423 |
7 | 642156555 |
oct | 221416467 |
9 | 78705156 |
10 | 38149431 |
11 | 1a597261 |
12 | 10939273 |
13 | 7b99438 |
14 | 50d0bd5 |
15 | 3538806 |
hex | 2461d37 |
38149431 has 8 divisors (see below), whose sum is σ = 51237744. Its totient is φ = 25247040.
The previous prime is 38149429. The next prime is 38149439. The reversal of 38149431 is 13494183.
38149431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 38149431 - 21 = 38149429 is a prime.
It is a super-2 number, since 2×381494312 = 2910758171247522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 38149392 and 38149401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (38149439) 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 7 ways as a sum of consecutive naturals, for example, 46000 + ... + 46821.
It is an arithmetic number, because the mean of its divisors is an integer number (6404718).
Almost surely, 238149431 is an apocalyptic number.
38149431 is a deficient number, since it is larger than the sum of its proper divisors (13088313).
38149431 is a wasteful number, since it uses less digits than its factorization.
38149431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92961.
The product of its digits is 10368, while the sum is 33.
The square root of 38149431 is about 6176.5225653275. The cubic root of 38149431 is about 336.6376514331.
The spelling of 38149431 in words is "thirty-eight million, one hundred forty-nine thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •