Base | Representation |
---|---|
bin | 1011011111000111100… |
… | …00001001000011110001 |
3 | 1101201200202012100002021 |
4 | 11233203300021003301 |
5 | 22431232221300420 |
6 | 501150011151441 |
7 | 40341055522060 |
oct | 5574360110361 |
9 | 1351622170067 |
10 | 394663071985 |
11 | 142415019396 |
12 | 645a3a45581 |
13 | 2b2a7a52480 |
14 | 1515d4781d7 |
15 | a3ed0db7aa |
hex | 5be3c090f1 |
394663071985 has 32 divisors (see below), whose sum is σ = 597103782912. Its totient is φ = 243715806720.
The previous prime is 394663071983. The next prime is 394663072003. The reversal of 394663071985 is 589170366493.
It is not a de Polignac number, because 394663071985 - 21 = 394663071983 is a prime.
It is not an unprimeable number, because it can be changed into a prime (394663071983) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10559289 + ... + 10596598.
It is an arithmetic number, because the mean of its divisors is an integer number (18659493216).
Almost surely, 2394663071985 is an apocalyptic number.
394663071985 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
394663071985 is a deficient number, since it is larger than the sum of its proper divisors (202440710927).
394663071985 is a wasteful number, since it uses less digits than its factorization.
394663071985 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21155953.
The product of its (nonzero) digits is 29393280, while the sum is 61.
The spelling of 394663071985 in words is "three hundred ninety-four billion, six hundred sixty-three million, seventy-one thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •