Search a number
-
+
395669314965 = 35103925387829
BaseRepresentation
bin1011100000111111011…
…10101001110110010101
31101211021212121202221210
411300133232221312111
522440312321034330
6501433514332033
740405024454061
oct5603756516625
91354255552853
10395669314965
11142891016661
1264824a2a019
132b408367112
1415216d6caa1
15a45b6028b0
hex5c1fba9d95

395669314965 has 16 divisors (see below), whose sum is σ = 633680236800. Its totient is φ = 210820523712.

The previous prime is 395669314927. The next prime is 395669314973. The reversal of 395669314965 is 569413966593.

It is not a de Polignac number, because 395669314965 - 214 = 395669298581 is a prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 395669314896 and 395669314905.

It is a congruent number.

It is an unprimeable number.

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, 12678330 + ... + 12709499.

It is an arithmetic number, because the mean of its divisors is an integer number (39605014800).

Almost surely, 2395669314965 is an apocalyptic number.

It is an amenable number.

395669314965 is a deficient number, since it is larger than the sum of its proper divisors (238010921835).

395669314965 is a wasteful number, since it uses less digits than its factorization.

395669314965 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 25388876.

The product of its digits is 141717600, while the sum is 66.

The spelling of 395669314965 in words is "three hundred ninety-five billion, six hundred sixty-nine million, three hundred fourteen thousand, nine hundred sixty-five".

Divisors: 1 3 5 15 1039 3117 5195 15585 25387829 76163487 126939145 380817435 26377954331 79133862993 131889771655 395669314965