Base | Representation |
---|---|
bin | 10111001101110… |
… | …110011011000000 |
3 | 1000010220222211000 |
4 | 113031312123000 |
5 | 1244203204002 |
6 | 102352252000 |
7 | 12436516125 |
oct | 2715663300 |
9 | 1003828730 |
10 | 389506752 |
11 | 18a959208 |
12 | aa541000 |
13 | 6290938b |
14 | 39a3274c |
15 | 242de61c |
hex | 173766c0 |
389506752 has 112 divisors (see below), whose sum is σ = 1166957280. Its totient is φ = 127355904.
The previous prime is 389506717. The next prime is 389506753. The reversal of 389506752 is 257605983.
It is a happy number.
It is a nialpdrome in base 12.
It is a junction number, because it is equal to n+sod(n) for n = 389506698 and 389506707.
It is not an unprimeable number, because it can be changed into a prime (389506753) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 89458 + ... + 93710.
Almost surely, 2389506752 is an apocalyptic number.
389506752 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 389506752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (583478640).
389506752 is an abundant number, since it is smaller than the sum of its proper divisors (777450528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
389506752 is a wasteful number, since it uses less digits than its factorization.
389506752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4327 (or 4311 counting only the distinct ones).
The product of its (nonzero) digits is 453600, while the sum is 45.
The square root of 389506752 is about 19735.9254153435. The cubic root of 389506752 is about 730.3062154373.
The spelling of 389506752 in words is "three hundred eighty-nine million, five hundred six thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •