Base | Representation |
---|---|
bin | 1001010111111… |
… | …1110111110000 |
3 | 2201222201101000 |
4 | 2111333313300 |
5 | 40031233242 |
6 | 3522442000 |
7 | 655136460 |
oct | 225776760 |
9 | 81881330 |
10 | 39321072 |
11 | 2021755a |
12 | 11203300 |
13 | 81b980b |
14 | 5317ba0 |
15 | 36baa4c |
hex | 257fdf0 |
39321072 has 80 divisors (see below), whose sum is σ = 128999680. Its totient is φ = 11233728.
The previous prime is 39321067. The next prime is 39321077. The reversal of 39321072 is 27012393.
It is an interprime number because it is at equal distance from previous prime (39321067) and next prime (39321077).
It is a super-2 number, since 2×393210722 = 3092293406458368, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (39321077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3478 + ... + 9525.
It is an arithmetic number, because the mean of its divisors is an integer number (1612496).
Almost surely, 239321072 is an apocalyptic number.
It is an amenable number.
39321072 is an abundant number, since it is smaller than the sum of its proper divisors (89678608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
39321072 is a wasteful number, since it uses less digits than its factorization.
39321072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13027 (or 13015 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 27.
The square root of 39321072 is about 6270.6516407787. The cubic root of 39321072 is about 340.0492200946.
The spelling of 39321072 in words is "thirty-nine million, three hundred twenty-one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •