Search a number
-
+
10031103121969 is a prime number
BaseRepresentation
bin1001000111111000110001…
…0101101001101000110001
31022111222000211020120001201
42101332030111221220301
52303322144344400334
633200120344531201
72053503041461216
oct221761425515061
938458024216051
1010031103121969
1132181922249a6
121160118180b01
13579c0cc252c7
14269717c89b0d
15125dea81cc14
hex91f8c569a31

10031103121969 has 2 divisors, whose sum is σ = 10031103121970. Its totient is φ = 10031103121968.

The previous prime is 10031103121931. The next prime is 10031103122011. The reversal of 10031103121969 is 96912130113001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5227716416400 + 4803386705569 = 2286420^2 + 2191663^2 .

It is a cyclic number.

It is not a de Polignac number, because 10031103121969 - 215 = 10031103089201 is a prime.

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

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

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

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

Almost surely, 210031103121969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8748, while the sum is 37.

The spelling of 10031103121969 in words is "ten trillion, thirty-one billion, one hundred three million, one hundred twenty-one thousand, nine hundred sixty-nine".