Search a number
-
+
99506031490673 is a prime number
BaseRepresentation
bin10110101000000000001101…
…101010001111011001110001
3111001022200110102102021210122
4112220000031222033121301
5101020301323030200143
6551344234555140025
726650034136115523
oct2650001552173161
9431280412367718
1099506031490673
11297842a8728a15
12b1b0b28744615
13436a4bc76b582
141a80190a77a13
15b785a8444c68
hex5a800da8f671

99506031490673 has 2 divisors, whose sum is σ = 99506031490674. Its totient is φ = 99506031490672.

The previous prime is 99506031490637. The next prime is 99506031490699. The reversal of 99506031490673 is 37609413060599.

Together with previous prime (99506031490637) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 73489676502544 + 26016354988129 = 8572612^2 + 5100623^2 .

It is a cyclic number.

It is not a de Polignac number, because 99506031490673 - 210 = 99506031489649 is a prime.

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

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

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

Almost surely, 299506031490673 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 33067440, while the sum is 62.

The spelling of 99506031490673 in words is "ninety-nine trillion, five hundred six billion, thirty-one million, four hundred ninety thousand, six hundred seventy-three".