Base | Representation |
---|---|
bin | 1011001100100011111… |
… | …11010011000111110101 |
3 | 1100202222111111220101111 |
4 | 11212101333103013311 |
5 | 22300332023112221 |
6 | 452421313355021 |
7 | 36536154524416 |
oct | 5462177230765 |
9 | 1322874456344 |
10 | 384701379061 |
11 | 13917299901a |
12 | 62683868a71 |
13 | 2a37ac8810c |
14 | 1489644780d |
15 | a018798be1 |
hex | 5991fd31f5 |
384701379061 has 2 divisors, whose sum is σ = 384701379062. Its totient is φ = 384701379060.
The previous prime is 384701379047. The next prime is 384701379071. The reversal of 384701379061 is 160973107483.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 384051638961 + 649740100 = 619719^2 + 25490^2 .
It is an emirp because it is prime and its reverse (160973107483) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 384701379061 - 27 = 384701378933 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 384701378996 and 384701379014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (384701379071) 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 as a sum of consecutive naturals, namely, 192350689530 + 192350689531.
It is an arithmetic number, because the mean of its divisors is an integer number (192350689531).
Almost surely, 2384701379061 is an apocalyptic number.
It is an amenable number.
384701379061 is a deficient number, since it is larger than the sum of its proper divisors (1).
384701379061 is an equidigital number, since it uses as much as digits as its factorization.
384701379061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 762048, while the sum is 49.
The spelling of 384701379061 in words is "three hundred eighty-four billion, seven hundred one million, three hundred seventy-nine thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •