Base | Representation |
---|---|
bin | 1011001101111011111… |
… | …11111110001101100001 |
3 | 1100211212221220012002112 |
4 | 11212331333332031201 |
5 | 22303340034044212 |
6 | 453022451325105 |
7 | 36563361562322 |
oct | 5467577761541 |
9 | 1324787805075 |
10 | 385439753057 |
11 | 139511768367 |
12 | 6284abb0795 |
13 | 2a467c41bc8 |
14 | 14926530449 |
15 | a05d4eb422 |
hex | 59bdffe361 |
385439753057 has 2 divisors, whose sum is σ = 385439753058. Its totient is φ = 385439753056.
The previous prime is 385439753053. The next prime is 385439753087. The reversal of 385439753057 is 750357934583.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 365995960576 + 19443792481 = 604976^2 + 139441^2 .
It is an emirp because it is prime and its reverse (750357934583) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 385439753057 - 22 = 385439753053 is a prime.
It is a super-2 number, since 2×3854397530572 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 385439752987 and 385439753005.
It is not a weakly prime, because it can be changed into another prime (385439753053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 192719876528 + 192719876529.
It is an arithmetic number, because the mean of its divisors is an integer number (192719876529).
Almost surely, 2385439753057 is an apocalyptic number.
It is an amenable number.
385439753057 is a deficient number, since it is larger than the sum of its proper divisors (1).
385439753057 is an equidigital number, since it uses as much as digits as its factorization.
385439753057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 47628000, while the sum is 59.
The spelling of 385439753057 in words is "three hundred eighty-five billion, four hundred thirty-nine million, seven hundred fifty-three thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •