Search a number
-
+
9196851457 is a prime number
BaseRepresentation
bin10001001000010110…
…01101000100000001
3212201221111110110001
420210023031010001
5122313343221312
64120332240001
7443622643003
oct104413150401
925657443401
109196851457
11399a423692
121948010001
13b374a4451
14633618373
1538c613057
hex2242cd101

9196851457 has 2 divisors, whose sum is σ = 9196851458. Its totient is φ = 9196851456.

The previous prime is 9196851421. The next prime is 9196851473. The reversal of 9196851457 is 7541586919.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8533325376 + 663526081 = 92376^2 + 25759^2 .

It is a cyclic number.

It is not a de Polignac number, because 9196851457 - 27 = 9196851329 is a prime.

It is a super-3 number, since 3×91968514573 (a number of 31 digits) contains 333 as substring.

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

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

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

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

Almost surely, 29196851457 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2721600, while the sum is 55.

The square root of 9196851457 is about 95900.2161467846. The cubic root of 9196851457 is about 2095.1400431558.

The spelling of 9196851457 in words is "nine billion, one hundred ninety-six million, eight hundred fifty-one thousand, four hundred fifty-seven".