Base | Representation |
---|---|
bin | 1011011110111011101… |
… | …11101001001001001001 |
3 | 1101201102212111000102120 |
4 | 11233131313221021021 |
5 | 22431031440000423 |
6 | 501132123521453 |
7 | 40335446565066 |
oct | 5573567511111 |
9 | 1351385430376 |
10 | 394564375113 |
11 | 142374337a27 |
12 | 64576989289 |
13 | 2b290476b5c |
14 | 15150305c6d |
15 | a3e45e2ee3 |
hex | 5bddde9249 |
394564375113 has 16 divisors (see below), whose sum is σ = 551256053760. Its totient is φ = 250553511824.
The previous prime is 394564375109. The next prime is 394564375129. The reversal of 394564375113 is 311573465493.
It is a cyclic number.
It is not a de Polignac number, because 394564375113 - 22 = 394564375109 is a prime.
It is a super-2 number, since 2×3945643751132 (a number of 24 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (51) 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 (394564375133) 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 15 ways as a sum of consecutive naturals, for example, 11946531 + ... + 11979512.
It is an arithmetic number, because the mean of its divisors is an integer number (34453503360).
Almost surely, 2394564375113 is an apocalyptic number.
It is an amenable number.
394564375113 is a deficient number, since it is larger than the sum of its proper divisors (156691678647).
394564375113 is a wasteful number, since it uses less digits than its factorization.
394564375113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23926308.
The product of its digits is 4082400, while the sum is 51.
The spelling of 394564375113 in words is "three hundred ninety-four billion, five hundred sixty-four million, three hundred seventy-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •