Base | Representation |
---|---|
bin | 1001010001111… |
… | …0100010101000 |
3 | 2201020110111200 |
4 | 2110132202220 |
5 | 34431004113 |
6 | 3510124200 |
7 | 651556260 |
oct | 224364250 |
9 | 81213450 |
10 | 38922408 |
11 | 1aa74a88 |
12 | 11050660 |
13 | 80aa215 |
14 | 52527a0 |
15 | 363c873 |
hex | 251e8a8 |
38922408 has 96 divisors (see below), whose sum is σ = 124675200. Its totient is φ = 10733184.
The previous prime is 38922397. The next prime is 38922419. The reversal of 38922408 is 80422983.
It is an interprime number because it is at equal distance from previous prime (38922397) and next prime (38922419).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
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, 13285 + ... + 15947.
It is an arithmetic number, because the mean of its divisors is an integer number (1298700).
Almost surely, 238922408 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 38922408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62337600).
38922408 is an abundant number, since it is smaller than the sum of its proper divisors (85752792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
38922408 is a wasteful number, since it uses less digits than its factorization.
38922408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2711 (or 2704 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The square root of 38922408 is about 6238.7825735475. The cubic root of 38922408 is about 338.8960968019.
The spelling of 38922408 in words is "thirty-eight million, nine hundred twenty-two thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •