Base | Representation |
---|---|
bin | 10111100000110… |
… | …111011100000000 |
3 | 1000111022020210210 |
4 | 113200313130000 |
5 | 1301442213043 |
6 | 103051154120 |
7 | 12530060265 |
oct | 2740673400 |
9 | 1014266723 |
10 | 394491648 |
11 | 192753461 |
12 | b0145940 |
13 | 63963315 |
14 | 3a56d26c |
15 | 24976633 |
hex | 17837700 |
394491648 has 72 divisors (see below), whose sum is σ = 1060329088. Its totient is φ = 130194432.
The previous prime is 394491631. The next prime is 394491673. The reversal of 394491648 is 846194493.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 394491597 and 394491606.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 76611 + ... + 81597.
Almost surely, 2394491648 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 394491648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (530164544).
394491648 is an abundant number, since it is smaller than the sum of its proper divisors (665837440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
394491648 is a wasteful number, since it uses less digits than its factorization.
394491648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5109 (or 5095 counting only the distinct ones).
The product of its digits is 746496, while the sum is 48.
The square root of 394491648 is about 19861.8138144531. The cubic root of 394491648 is about 733.4084977134.
The spelling of 394491648 in words is "three hundred ninety-four million, four hundred ninety-one thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •