Search a number
-
+
100915567393 is a prime number
BaseRepresentation
bin101110111111100001…
…0010101101100100001
3100122110222102222121011
41131333002111230201
53123133341124033
6114205430500521
710201532112124
oct1357702255441
9318428388534
10100915567393
1139886230473
1217684504741
1396933c6ab4
144c548b03bb
1529597ddccd
hex177f095b21

100915567393 has 2 divisors, whose sum is σ = 100915567394. Its totient is φ = 100915567392.

The previous prime is 100915567391. The next prime is 100915567421. The reversal of 100915567393 is 393765519001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 98425257984 + 2490309409 = 313728^2 + 49903^2 .

It is a cyclic number.

It is not a de Polignac number, because 100915567393 - 21 = 100915567391 is a prime.

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

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

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

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

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

Almost surely, 2100915567393 is an apocalyptic number.

It is an amenable number.

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

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

100915567393 is an evil number, because the sum of its binary digits is even.

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

The spelling of 100915567393 in words is "one hundred billion, nine hundred fifteen million, five hundred sixty-seven thousand, three hundred ninety-three".