Search a number
-
+
90504955901 is a prime number
BaseRepresentation
bin101010001001010000…
…1000000011111111101
322122121110001010101202
41110102201000133331
52440323232042101
6105324415145245
76352540301123
oct1242241003775
9278543033352
1090504955901
1135423762a18
1215659b15225
1386c4621059
144547dc3913
15254a87336b
hex15128407fd

90504955901 has 2 divisors, whose sum is σ = 90504955902. Its totient is φ = 90504955900.

The previous prime is 90504955867. The next prime is 90504955969. The reversal of 90504955901 is 10955940509.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 89311322500 + 1193633401 = 298850^2 + 34549^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 90504955901 - 222 = 90500761597 is a prime.

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

It is a congruent number.

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

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

Almost surely, 290504955901 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 364500, while the sum is 47.

The spelling of 90504955901 in words is "ninety billion, five hundred four million, nine hundred fifty-five thousand, nine hundred one".