Base | Representation |
---|---|
bin | 10111100010101… |
… | …100111001100010 |
3 | 1000112012200210010 |
4 | 113202230321202 |
5 | 1302103112040 |
6 | 103105345350 |
7 | 12534133053 |
oct | 2742547142 |
9 | 1015180703 |
10 | 394972770 |
11 | 192a51985 |
12 | b0338256 |
13 | 63aa12ca |
14 | 3a65672a |
15 | 24a1de80 |
hex | 178ace62 |
394972770 has 32 divisors (see below), whose sum is σ = 953184960. Its totient is φ = 104742720.
The previous prime is 394972769. The next prime is 394972771. The reversal of 394972770 is 77279493.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (394972769) and next prime (394972771).
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (394972771) 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, 30940 + ... + 41799.
It is an arithmetic number, because the mean of its divisors is an integer number (29787030).
Almost surely, 2394972770 is an apocalyptic number.
394972770 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
394972770 is an abundant number, since it is smaller than the sum of its proper divisors (558212190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
394972770 is a wasteful number, since it uses less digits than its factorization.
394972770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72930.
The product of its (nonzero) digits is 666792, while the sum is 48.
The square root of 394972770 is about 19873.9218575499. The cubic root of 394972770 is about 733.7065315782.
The spelling of 394972770 in words is "three hundred ninety-four million, nine hundred seventy-two thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •