Base | Representation |
---|---|
bin | 10111100001000… |
… | …100011110110000 |
3 | 1000111101222002110 |
4 | 113201010132300 |
5 | 1302000420242 |
6 | 103052245320 |
7 | 12530402115 |
oct | 2741043660 |
9 | 1014358073 |
10 | 394545072 |
11 | 19278a609 |
12 | b0170840 |
13 | 6398172c |
14 | 3a58490c |
15 | 2498739c |
hex | 178447b0 |
394545072 has 90 divisors (see below), whose sum is σ = 1058740644. Its totient is φ = 126606720.
The previous prime is 394545043. The next prime is 394545101. The reversal of 394545072 is 270545493.
It is an interprime number because it is at equal distance from previous prime (394545043) and next prime (394545101).
It is a self number, because there is not a number n which added to its sum of digits gives 394545072.
It is an unprimeable number.
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 17 ways as a sum of consecutive naturals, for example, 6467922 + ... + 6467982.
Almost surely, 2394545072 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 394545072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (529370322).
394545072 is an abundant number, since it is smaller than the sum of its proper divisors (664195572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
394545072 is an equidigital number, since it uses as much as digits as its factorization.
394545072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227 (or 113 counting only the distinct ones).
The product of its (nonzero) digits is 151200, while the sum is 39.
The square root of 394545072 is about 19863.1586611999. The cubic root of 394545072 is about 733.4416034815.
The spelling of 394545072 in words is "three hundred ninety-four million, five hundred forty-five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •