Search a number
-
+
9901691057 is a prime number
BaseRepresentation
bin10010011100010111…
…11101000010110001
3221120001210000121102
421032023331002301
5130234313103212
64314311334145
7500241661646
oct111613750261
927501700542
109901691057
114221279055
121b04081355
13c1a5195bb
1469d091dcd
153ce43e5c2
hex24e2fd0b1

9901691057 has 2 divisors, whose sum is σ = 9901691058. Its totient is φ = 9901691056.

The previous prime is 9901691053. The next prime is 9901691071. The reversal of 9901691057 is 7501961099.

9901691057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 6056574976 + 3845116081 = 77824^2 + 62009^2 .

It is a cyclic number.

It is not a de Polignac number, because 9901691057 - 22 = 9901691053 is a prime.

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

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

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

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

Almost surely, 29901691057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 153090, while the sum is 47.

The square root of 9901691057 is about 99507.2412289679. The cubic root of 9901691057 is about 2147.3514208772.

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