Base | Representation |
---|---|
bin | 1001010001001… |
… | …0000101101101 |
3 | 2201010212112200 |
4 | 2110102011231 |
5 | 34422341110 |
6 | 3505052113 |
7 | 651254466 |
oct | 224220555 |
9 | 81125480 |
10 | 38871405 |
11 | 1aa3a731 |
12 | 11027039 |
13 | 808cc41 |
14 | 523bd6d |
15 | 362c6c0 |
hex | 251216d |
38871405 has 24 divisors (see below), whose sum is σ = 68305848. Its totient is φ = 20445696.
The previous prime is 38871389. The next prime is 38871407. The reversal of 38871405 is 50417883.
It can be written as a sum of positive squares in 4 ways, for example, as 13439556 + 25431849 = 3666^2 + 5043^2 .
It is not a de Polignac number, because 38871405 - 24 = 38871389 is a prime.
It is a super-2 number, since 2×388714052 = 3021972253348050, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 38871405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (38871407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2632 + ... + 9201.
It is an arithmetic number, because the mean of its divisors is an integer number (2846077).
Almost surely, 238871405 is an apocalyptic number.
It is an amenable number.
38871405 is a deficient number, since it is larger than the sum of its proper divisors (29434443).
38871405 is a wasteful number, since it uses less digits than its factorization.
38871405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11917 (or 11914 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 36.
The square root of 38871405 is about 6234.6936572698. The cubic root of 38871405 is about 338.7480049628.
The spelling of 38871405 in words is "thirty-eight million, eight hundred seventy-one thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •