Base | Representation |
---|---|
bin | 1011011101101111011… |
… | …11011011110010101101 |
3 | 1101122210021210121010212 |
4 | 11232313233123302231 |
5 | 22423224210022234 |
6 | 500544433112205 |
7 | 40313551416152 |
oct | 5566757336255 |
9 | 1348707717125 |
10 | 393924689069 |
11 | 14207624337a |
12 | 644186b8665 |
13 | 2b1baa945c2 |
14 | 150cd38c229 |
15 | a3a83865ce |
hex | 5bb7bdbcad |
393924689069 has 2 divisors, whose sum is σ = 393924689070. Its totient is φ = 393924689068.
The previous prime is 393924689021. The next prime is 393924689071. The reversal of 393924689069 is 960986429393.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 220677276169 + 173247412900 = 469763^2 + 416230^2 .
It is an emirp because it is prime and its reverse (960986429393) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 393924689069 - 224 = 393907911853 is a prime.
It is a super-2 number, since 2×3939246890692 (a number of 24 digits) contains 22 as substring.
Together with 393924689071, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (393924682069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 196962344534 + 196962344535.
It is an arithmetic number, because the mean of its divisors is an integer number (196962344535).
Almost surely, 2393924689069 is an apocalyptic number.
It is an amenable number.
393924689069 is a deficient number, since it is larger than the sum of its proper divisors (1).
393924689069 is an equidigital number, since it uses as much as digits as its factorization.
393924689069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 136048896, while the sum is 68.
The spelling of 393924689069 in words is "three hundred ninety-three billion, nine hundred twenty-four million, six hundred eighty-nine thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •