Base | Representation |
---|---|
bin | 100100010111101100… |
… | …101100100000000000 |
3 | 10201210121210022002022 |
4 | 210113230230200000 |
5 | 1114434342020430 |
6 | 25535042141012 |
7 | 2551516025624 |
oct | 442754544000 |
9 | 121717708068 |
10 | 39052298240 |
11 | 1562000574a |
12 | 769a651768 |
13 | 38b49268a7 |
14 | 1c66795184 |
15 | 10386d64e5 |
hex | 917b2c800 |
39052298240 has 192 divisors, whose sum is σ = 97922260800. Its totient is φ = 14932574208.
The previous prime is 39052298237. The next prime is 39052298249. The reversal of 39052298240 is 4289225093.
It is a junction number, because it is equal to n+sod(n) for n = 39052298191 and 39052298200.
It is not an unprimeable number, because it can be changed into a prime (39052298249) 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, 22353047 + ... + 22354793.
It is an arithmetic number, because the mean of its divisors is an integer number (510011775).
Almost surely, 239052298240 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 39052298240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48961130400).
39052298240 is an abundant number, since it is smaller than the sum of its proper divisors (58869962560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
39052298240 is a wasteful number, since it uses less digits than its factorization.
39052298240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1870 (or 1850 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 44.
The spelling of 39052298240 in words is "thirty-nine billion, fifty-two million, two hundred ninety-eight thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •