Search a number
-
+
100567383040291 is a prime number
BaseRepresentation
bin10110110111011100101011…
…001001000110000100100011
3111012002010222211121100120011
4112313130223021012010203
5101140144000024242131
6553520003514225351
730116516334333256
oct2667345311060443
9435063884540504
10100567383040291
112a053429a38122
12b342771125257
1344166044aaa9b
141ab96b727309d
15b95ec5dd30b1
hex5b772b246123

100567383040291 has 2 divisors, whose sum is σ = 100567383040292. Its totient is φ = 100567383040290.

The previous prime is 100567383040237. The next prime is 100567383040309. The reversal of 100567383040291 is 192040383765001.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 100567383040291 - 237 = 100429944086819 is a prime.

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

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

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅100567383040291 = 201134766080582 is not.

Almost surely, 2100567383040291 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1088640, while the sum is 49.

The spelling of 100567383040291 in words is "one hundred trillion, five hundred sixty-seven billion, three hundred eighty-three million, forty thousand, two hundred ninety-one".