Base | Representation |
---|---|
bin | 1011011111001100011… |
… | …00011110011100110101 |
3 | 1101201210121022102221020 |
4 | 11233212030132130311 |
5 | 22431323214212234 |
6 | 501154033411353 |
7 | 40342064050263 |
oct | 5574614363465 |
9 | 1351717272836 |
10 | 394704054069 |
11 | 14243616a886 |
12 | 645b5709b59 |
13 | 2b2b33a1020 |
14 | 15164aa5433 |
15 | a4019d4549 |
hex | 5be631e735 |
394704054069 has 32 divisors (see below), whose sum is σ = 582158083584. Its totient is φ = 236295221760.
The previous prime is 394704054007. The next prime is 394704054089. The reversal of 394704054069 is 960450407493.
It is a happy number.
It is not a de Polignac number, because 394704054069 - 27 = 394704053941 is a prime.
It is a super-4 number, since 4×3947040540694 (a number of 47 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (394704054089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12427129 + ... + 12458849.
It is an arithmetic number, because the mean of its divisors is an integer number (18192440112).
Almost surely, 2394704054069 is an apocalyptic number.
394704054069 is a gapful number since it is divisible by the number (39) formed by its first and last digit.
It is an amenable number.
394704054069 is a deficient number, since it is larger than the sum of its proper divisors (187454029515).
394704054069 is a wasteful number, since it uses less digits than its factorization.
394704054069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40397.
The product of its (nonzero) digits is 3265920, while the sum is 51.
The spelling of 394704054069 in words is "three hundred ninety-four billion, seven hundred four million, fifty-four thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •