Search a number
-
+
100033391267497 is a prime number
BaseRepresentation
bin10110101111101011010110…
…110000001000111010101001
3111010012002200000212200002201
4112233223112300020322221
5101102421341131024442
6552430412221300201
730033113455215322
oct2657532660107251
9433162600780081
10100033391267497
1129967a17561716
12b277184404661
1343a8153c971ac
141a9b8db7d3449
15b87170ec87b7
hex5afad6c08ea9

100033391267497 has 2 divisors, whose sum is σ = 100033391267498. Its totient is φ = 100033391267496.

The previous prime is 100033391267417. The next prime is 100033391267539. The reversal of 100033391267497 is 794762193330001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 93081183283881 + 6952207983616 = 9647859^2 + 2636704^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-100033391267497 is a prime.

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

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

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

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

Almost surely, 2100033391267497 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5143824, while the sum is 55.

The spelling of 100033391267497 in words is "one hundred trillion, thirty-three billion, three hundred ninety-one million, two hundred sixty-seven thousand, four hundred ninety-seven".