Base | Representation |
---|---|
bin | 1001000111010… |
… | …0000011111000 |
3 | 2122220222122011 |
4 | 2101310003320 |
5 | 34241132440 |
6 | 3443135304 |
7 | 642620404 |
oct | 221640370 |
9 | 78828564 |
10 | 38224120 |
11 | 1a638390 |
12 | 10974534 |
13 | 7bc442c |
14 | 5110104 |
15 | 35509ea |
hex | 24740f8 |
38224120 has 64 divisors (see below), whose sum is σ = 94802400. Its totient is φ = 13754880.
The previous prime is 38224063. The next prime is 38224139. The reversal of 38224120 is 2142283.
It is a super-2 number, since 2×382241202 = 2922166699548800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 38224091 and 38224100.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 47562 + ... + 48358.
Almost surely, 238224120 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 38224120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47401200).
38224120 is an abundant number, since it is smaller than the sum of its proper divisors (56578280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
38224120 is a wasteful number, since it uses less digits than its factorization.
38224120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 928 (or 924 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 38224120 is about 6182.5658104059. The cubic root of 38224120 is about 336.8571980799.
The spelling of 38224120 in words is "thirty-eight million, two hundred twenty-four thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •