Base | Representation |
---|---|
bin | 1001000111101… |
… | …1011010101000 |
3 | 2122222111222000 |
4 | 2101323122220 |
5 | 34243113443 |
6 | 3443531000 |
7 | 643104264 |
oct | 221733250 |
9 | 78874860 |
10 | 38254248 |
11 | 1a658a8a |
12 | 10989a60 |
13 | 7c05066 |
14 | 511b0a4 |
15 | 35598d3 |
hex | 247b6a8 |
38254248 has 128 divisors (see below), whose sum is σ = 114048000. Its totient is φ = 11854080.
The previous prime is 38254231. The next prime is 38254273. The reversal of 38254248 is 84245283.
38254248 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 194086 + ... + 194282.
It is an arithmetic number, because the mean of its divisors is an integer number (891000).
Almost surely, 238254248 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 38254248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57024000).
38254248 is an abundant number, since it is smaller than the sum of its proper divisors (75793752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
38254248 is a wasteful number, since it uses less digits than its factorization.
38254248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272 (or 262 counting only the distinct ones).
The product of its digits is 61440, while the sum is 36.
The square root of 38254248 is about 6185.0018593368. The cubic root of 38254248 is about 336.9456777137.
The spelling of 38254248 in words is "thirty-eight million, two hundred fifty-four thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.480 sec. • engine limits •