Base | Representation |
---|---|
bin | 1001010110111… |
… | …0100001010000 |
3 | 2201212002212201 |
4 | 2111232201100 |
5 | 40022000000 |
6 | 3521132544 |
7 | 654422326 |
oct | 225564120 |
9 | 81762781 |
10 | 39250000 |
11 | 20179119 |
12 | 1118a154 |
13 | 819336a |
14 | 52d9d16 |
15 | 36a496a |
hex | 256e850 |
39250000 has 70 divisors (see below), whose sum is σ = 95662838. Its totient is φ = 15600000.
The previous prime is 39249971. The next prime is 39250037. The reversal of 39250000 is 5293.
It can be written as a sum of positive squares in 7 ways, for example, as 38489616 + 760384 = 6204^2 + 872^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 39250000.
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 13 ways as a sum of consecutive naturals, for example, 249922 + ... + 250078.
Almost surely, 239250000 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 39250000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47831419).
39250000 is an abundant number, since it is smaller than the sum of its proper divisors (56412838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
39250000 is an frugal number, since it uses more digits than its factorization.
39250000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195 (or 164 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 19.
The square root of 39250000 is about 6264.9820430708. The cubic root of 39250000 is about 339.8442192930.
Adding to 39250000 its reverse (5293), we get a palindrome (39255293).
The spelling of 39250000 in words is "thirty-nine million, two hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •