Search a number
-
+
10093015321 is a prime number
BaseRepresentation
bin10010110011001011…
…10011000100011001
3222001101210022011021
421121211303010121
5131132302442241
64345304202441
7505054133434
oct113145630431
928041708137
1010093015321
11430a275884
121b58169421
13c4b056a1c
146ba65681b
153e11330d1
hex259973119

10093015321 has 2 divisors, whose sum is σ = 10093015322. Its totient is φ = 10093015320.

The previous prime is 10093015313. The next prime is 10093015333. The reversal of 10093015321 is 12351039001.

10093015321 is digitally balanced in base 3, 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., 10093015296 + 25 = 100464^2 + 5^2 .

It is a cyclic number.

It is not a de Polignac number, because 10093015321 - 23 = 10093015313 is a prime.

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

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

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

Almost surely, 210093015321 is an apocalyptic number.

It is an amenable number.

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

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

10093015321 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 810, while the sum is 25.

Subtracting from 10093015321 its sum of digits (25), we obtain a square (10093015296 = 1004642).

The spelling of 10093015321 in words is "ten billion, ninety-three million, fifteen thousand, three hundred twenty-one".