Search a number
-
+
10091612569 is a prime number
BaseRepresentation
bin10010110011000000…
…11100100110011001
3222001022011000221111
421121200130212121
5131131423100234
64345214140321
7505036201663
oct113140344631
928038130844
1010091612569
1143094a7985
121b577b16a1
13c4a9853ac
146ba3ad533
153e0e57664
hex25981c999

10091612569 has 2 divisors, whose sum is σ = 10091612570. Its totient is φ = 10091612568.

The previous prime is 10091612513. The next prime is 10091612581. The reversal of 10091612569 is 96521619001.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7344490000 + 2747122569 = 85700^2 + 52413^2 .

It is an emirp because it is prime and its reverse (96521619001) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10091612569 - 27 = 10091612441 is a prime.

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

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

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

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

Almost surely, 210091612569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 29160, while the sum is 40.

The spelling of 10091612569 in words is "ten billion, ninety-one million, six hundred twelve thousand, five hundred sixty-nine".