Search a number
-
+
100105500505487 is a prime number
BaseRepresentation
bin10110110000101110100000…
…110011000011010110001111
3111010102222210110010111112212
4112300232200303003112033
5101110112031112133422
6552523455420421035
730041245423506011
oct2660564063032617
9433388713114485
10100105500505487
1129995560321484
12b2891496a777b
1343b1ba63b5459
141aa11bc5bc1b1
15b88e918789e2
hex5b0ba0cc358f

100105500505487 has 2 divisors, whose sum is σ = 100105500505488. Its totient is φ = 100105500505486.

The previous prime is 100105500505463. The next prime is 100105500505501. The reversal of 100105500505487 is 784505005501001.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 100105500505487 - 210 = 100105500504463 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (100105500505687) 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, 50052750252743 + 50052750252744.

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

Almost surely, 2100105500505487 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 140000, while the sum is 41.

The spelling of 100105500505487 in words is "one hundred trillion, one hundred five billion, five hundred million, five hundred five thousand, four hundred eighty-seven".