Search a number
-
+
100031512493569 is a prime number
BaseRepresentation
bin10110101111101001100110…
…110001001011111000000001
3111010011220211002122001210011
4112233221212301023320001
5101102404014144243234
6552425501544504521
730033016063002316
oct2657514661137001
9433156732561704
10100031512493569
1129967142a93a98
12b27693b17b141
1343a7c14985b47
141a9b7a0092d0d
15b870b10aeb64
hex5afa66c4be01

100031512493569 has 2 divisors, whose sum is σ = 100031512493570. Its totient is φ = 100031512493568.

The previous prime is 100031512493567. The next prime is 100031512493587. The reversal of 100031512493569 is 965394215130001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 99943607952400 + 87904541169 = 9997180^2 + 296487^2 .

It is a cyclic number.

It is not a de Polignac number, because 100031512493569 - 21 = 100031512493567 is a prime.

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

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

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

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

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

Almost surely, 2100031512493569 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 100031512493569 in words is "one hundred trillion, thirty-one billion, five hundred twelve million, four hundred ninety-three thousand, five hundred sixty-nine".