Search a number
-
+
99046273969 is a prime number
BaseRepresentation
bin101110000111110011…
…1100011001110110001
3100110122201001001002101
41130033213203032301
53110321321231334
6113300133220401
710104313303066
oct1341747431661
9313581031071
1099046273969
1139007048675
1217242491701
139456054a06
144b1851ac6d
15289a649214
hex170f9e33b1

99046273969 has 2 divisors, whose sum is σ = 99046273970. Its totient is φ = 99046273968.

The previous prime is 99046273943. The next prime is 99046273981. The reversal of 99046273969 is 96937264099.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 77124510369 + 21921763600 = 277713^2 + 148060^2 .

It is a cyclic number.

It is not a de Polignac number, because 99046273969 - 213 = 99046265777 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 99046273969.

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

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

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

Almost surely, 299046273969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 39680928, while the sum is 64.

The spelling of 99046273969 in words is "ninety-nine billion, forty-six million, two hundred seventy-three thousand, nine hundred sixty-nine".