Search a number
-
+
1031013015001 is a prime number
BaseRepresentation
bin11110000000011010010…
…10100001110111011001
310122120020001212211012021
433000031022201313121
5113343003312440001
62105350231014441
7134326315013254
oct17001512416731
93576201784167
101031013015001
11368282a72102
1214799820a421
13762bb4a6aa8
1437c8922a09b
151bc44292ba1
hexf00d2a1dd9

1031013015001 has 2 divisors, whose sum is σ = 1031013015002. Its totient is φ = 1031013015000.

The previous prime is 1031013014939. The next prime is 1031013015017. The reversal of 1031013015001 is 1005103101301.

It is an a-pointer prime, because the next prime (1031013015017) can be obtained adding 1031013015001 to its sum of digits (16).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 587217222601 + 443795792400 = 766301^2 + 666180^2 .

It is a cyclic number.

It is not a de Polignac number, because 1031013015001 - 27 = 1031013014873 is a prime.

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

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

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

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

Almost surely, 21031013015001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 45, while the sum is 16.

Adding to 1031013015001 its reverse (1005103101301), we get a palindrome (2036116116302).

The spelling of 1031013015001 in words is "one trillion, thirty-one billion, thirteen million, fifteen thousand, one".