Search a number
-
+
90101110131133 is a prime number
BaseRepresentation
bin10100011111001001001100…
…101010011100100110111101
3102211000120201021122010022221
4110133021030222130212331
543302204033143144013
6515343513434405341
724656406334433233
oct2437111452344675
9384016637563287
1090101110131133
1126788736813202
12a132247590851
133b376627b72aa
141836cba35c953
15a63b0b29e08d
hex51f24ca9c9bd

90101110131133 has 2 divisors, whose sum is σ = 90101110131134. Its totient is φ = 90101110131132.

The previous prime is 90101110131119. The next prime is 90101110131173. The reversal of 90101110131133 is 33113101110109.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 48140797859449 + 41960312271684 = 6938357^2 + 6477678^2 .

It is a cyclic number.

It is not a de Polignac number, because 90101110131133 - 213 = 90101110122941 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 90101110131098 and 90101110131107.

It is a congruent number.

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

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

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

Almost surely, 290101110131133 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 90101110131133 in words is "ninety trillion, one hundred one billion, one hundred ten million, one hundred thirty-one thousand, one hundred thirty-three".