Search a number
-
+
935071016953 is a prime number
BaseRepresentation
bin11011001101101101001…
…00110110011111111001
310022101120201002100010011
431212312210312133321
5110310011140020303
61553322105021521
7124361634334243
oct15466644663771
93271521070104
10935071016953
1133061a236a27
121312814848a1
136a23b616448
14333870db093
15194cb43916d
hexd9b69367f9

935071016953 has 2 divisors, whose sum is σ = 935071016954. Its totient is φ = 935071016952.

The previous prime is 935071016923. The next prime is 935071016993. The reversal of 935071016953 is 359610170539.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 918170236944 + 16900780009 = 958212^2 + 130003^2 .

It is a cyclic number.

It is not a de Polignac number, because 935071016953 - 29 = 935071016441 is a prime.

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

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

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

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

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

Almost surely, 2935071016953 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 765450, while the sum is 49.

The spelling of 935071016953 in words is "nine hundred thirty-five billion, seventy-one million, sixteen thousand, nine hundred fifty-three".