Search a number
-
+
99115468453 is a prime number
BaseRepresentation
bin101110001001110111…
…1100000011010100101
3100110211112020111002001
41130103233200122211
53110442024442303
6113311044245301
710106113403221
oct1342357403245
9313745214061
1099115468453
11390421094a1
12172616a0831
1394674a09b1
144b237ad781
1528a176631d
hex1713be06a5

99115468453 has 2 divisors, whose sum is σ = 99115468454. Its totient is φ = 99115468452.

The previous prime is 99115468451. The next prime is 99115468469. The reversal of 99115468453 is 35486451199.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 85006067364 + 14109401089 = 291558^2 + 118783^2 .

It is a cyclic number.

It is not a de Polignac number, because 99115468453 - 21 = 99115468451 is a prime.

Together with 99115468451, it forms a pair of twin primes.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 299115468453 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 4665600, while the sum is 55.

The spelling of 99115468453 in words is "ninety-nine billion, one hundred fifteen million, four hundred sixty-eight thousand, four hundred fifty-three".