Search a number
-
+
1405270566149 is a prime number
BaseRepresentation
bin10100011100110000101…
…001110010010100000101
311222100020201111022000112
4110130300221302110011
5141010443231104044
62553323345122405
7203345625504062
oct24346051622405
94870221438015
101405270566149
114a1a7666568a
121a8426329405
13a2693829178
144c0305bbc69
152684ac0e09e
hex14730a72505

1405270566149 has 2 divisors, whose sum is σ = 1405270566150. Its totient is φ = 1405270566148.

The previous prime is 1405270566101. The next prime is 1405270566157. The reversal of 1405270566149 is 9416650725041.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1253992353124 + 151278213025 = 1119818^2 + 388945^2 .

It is a cyclic number.

It is not a de Polignac number, because 1405270566149 - 220 = 1405269517573 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1405270566097 and 1405270566106.

It is a congruent number.

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

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

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

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

Almost surely, 21405270566149 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1814400, while the sum is 50.

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