Base | Representation |
---|---|
bin | 1001001101101… |
… | …0001101000100 |
3 | 2200201020112201 |
4 | 2103122031010 |
5 | 34343030000 |
6 | 3500124244 |
7 | 646312231 |
oct | 223321504 |
9 | 80636481 |
10 | 38642500 |
11 | 1a8a3756 |
12 | 10b36684 |
13 | 800c9b0 |
14 | 51bc788 |
15 | 35d496a |
hex | 24da344 |
38642500 has 120 divisors (see below), whose sum is σ = 96437880. Its totient is φ = 13440000.
The previous prime is 38642473. The next prime is 38642501. The reversal of 38642500 is 524683.
It can be written as a sum of positive squares in 20 ways, for example, as 33942276 + 4700224 = 5826^2 + 2168^2 .
It is not an unprimeable number, because it can be changed into a prime (38642501) 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 39 ways as a sum of consecutive naturals, for example, 942480 + ... + 942520.
It is an arithmetic number, because the mean of its divisors is an integer number (803649).
Almost surely, 238642500 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 38642500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48218940).
38642500 is an abundant number, since it is smaller than the sum of its proper divisors (57795380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
38642500 is a wasteful number, since it uses less digits than its factorization.
38642500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107 (or 90 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 28.
The square root of 38642500 is about 6216.3091943693. The cubic root of 38642500 is about 338.0817584043.
The spelling of 38642500 in words is "thirty-eight million, six hundred forty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •