Base | Representation |
---|---|
bin | 1001011010101… |
… | …0001001011110 |
3 | 2202022111220120 |
4 | 2112222021132 |
5 | 40102303423 |
6 | 3530255410 |
7 | 656460360 |
oct | 226521136 |
9 | 82274816 |
10 | 39494238 |
11 | 20325673 |
12 | 11287566 |
13 | 824a594 |
14 | 5360d30 |
15 | 3701ee3 |
hex | 25aa25e |
39494238 has 32 divisors (see below), whose sum is σ = 90892800. Its totient is φ = 11206560.
The previous prime is 39494237. The next prime is 39494249. The reversal of 39494238 is 83249493.
It is a happy number.
39494238 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 (42).
It is a self number, because there is not a number n which added to its sum of digits gives 39494238.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (39494237) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 3103 + ... + 9413.
It is an arithmetic number, because the mean of its divisors is an integer number (2840400).
Almost surely, 239494238 is an apocalyptic number.
39494238 is an abundant number, since it is smaller than the sum of its proper divisors (51398562).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
39494238 is a wasteful number, since it uses less digits than its factorization.
39494238 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6472.
The product of its digits is 186624, while the sum is 42.
The square root of 39494238 is about 6284.4441281628. Note that the first 3 decimals coincide. The cubic root of 39494238 is about 340.5476698231.
The spelling of 39494238 in words is "thirty-nine million, four hundred ninety-four thousand, two hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •