Search a number
-
+
1054152420401 is a prime number
BaseRepresentation
bin11110101011100000110…
…00010110110000110001
310201202221200202102001002
433111300120112300301
5114232401004423101
62124134304451345
7136105610505503
oct17256030266061
93652850672032
101054152420401
11377077617943
12150375619b55
13785383c5752
1439042445d73
151c64a93cd6b
hexf570616c31

1054152420401 has 2 divisors, whose sum is σ = 1054152420402. Its totient is φ = 1054152420400.

The previous prime is 1054152420383. The next prime is 1054152420421. The reversal of 1054152420401 is 1040242514501.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 947974849600 + 106177570801 = 973640^2 + 325849^2 .

It is a cyclic number.

It is not a de Polignac number, because 1054152420401 - 230 = 1053078678577 is a prime.

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

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

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

Almost surely, 21054152420401 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6400, while the sum is 29.

Adding to 1054152420401 its reverse (1040242514501), we get a palindrome (2094394934902).

The spelling of 1054152420401 in words is "one trillion, fifty-four billion, one hundred fifty-two million, four hundred twenty thousand, four hundred one".