Search a number
-
+
1405270566101 is a prime number
BaseRepresentation
bin10100011100110000101…
…001110010010011010101
311222100020201111021221202
4110130300221302103111
5141010443231103401
62553323345122245
7203345625503663
oct24346051622325
94870221437852
101405270566101
114a1a76665646
121a8426329385
13a269382913c
144c0305bbc33
152684ac0e06b
hex14730a724d5

1405270566101 has 2 divisors, whose sum is σ = 1405270566102. Its totient is φ = 1405270566100.

The previous prime is 1405270566097. The next prime is 1405270566149. The reversal of 1405270566101 is 1016650725041.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1269511479076 + 135759087025 = 1126726^2 + 368455^2 .

It is a cyclic number.

It is not a de Polignac number, because 1405270566101 - 22 = 1405270566097 is a prime.

It is a super-4 number, since 4×14052705661014 (a number of 50 digits) contains 4444 as substring.

It is a congruent number.

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

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

Almost surely, 21405270566101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 50400, while the sum is 38.

The spelling of 1405270566101 in words is "one trillion, four hundred five billion, two hundred seventy million, five hundred sixty-six thousand, one hundred one".