Search a number
-
+
10222421969 is a prime number
BaseRepresentation
bin10011000010100110…
…11100011111010001
3222101102021211201002
421201103130133101
5131413420000334
64410205551345
7511215103334
oct114123343721
928342254632
1010222421969
114376321a21
121b93575555
13c6bac53c6
146cd90061b
153ec695b7e
hex2614dc7d1

10222421969 has 2 divisors, whose sum is σ = 10222421970. Its totient is φ = 10222421968.

The previous prime is 10222421953. The next prime is 10222421983. The reversal of 10222421969 is 96912422201.

10222421969 is digitally balanced in base 2, 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., 8365846225 + 1856575744 = 91465^2 + 43088^2 .

It is a cyclic number.

It is not a de Polignac number, because 10222421969 - 24 = 10222421953 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (10222421939) 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, 5111210984 + 5111210985.

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

Almost surely, 210222421969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 31104, while the sum is 38.

The spelling of 10222421969 in words is "ten billion, two hundred twenty-two million, four hundred twenty-one thousand, nine hundred sixty-nine".