Search a number
-
+
445756051403359 is a prime number
BaseRepresentation
bin110010101011010011010101…
…1000110011011001001011111
32011110021212021122101222001121
41211112212223012123021133
5431411231343124401414
64220013300353151411
7162614545332450064
oct14526465306331137
92143255248358047
10445756051403359
1111a0390971a9874
1241bb261385b567
13161957cca0c268
147c109caa90c6b
1536802103a7724
hex19569ab19b25f

445756051403359 has 2 divisors, whose sum is σ = 445756051403360. Its totient is φ = 445756051403358.

The previous prime is 445756051403329. The next prime is 445756051403381. The reversal of 445756051403359 is 953304150657544.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 445756051403359 - 243 = 436959958381151 is a prime.

It is a super-2 number, since 2×4457560514033592 (a number of 30 digits) contains 22 as substring.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (445756051403329) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 222878025701679 + 222878025701680.

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

Almost surely, 2445756051403359 is an apocalyptic number.

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

445756051403359 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 136080000, while the sum is 61.

The spelling of 445756051403359 in words is "four hundred forty-five trillion, seven hundred fifty-six billion, fifty-one million, four hundred three thousand, three hundred fifty-nine".