Search a number
-
+
1350245356051 is a prime number
BaseRepresentation
bin10011101001100000111…
…001010001001000010011
311210002012220212000002011
4103221200321101020103
5134110300302343201
62512143312003351
7166360224105034
oct23514071211023
94702186760064
101350245356051
114806aa336939
1219982a530557
139a434941b57
14494d0706a8b
15251ca0d3151
hex13a60e51213

1350245356051 has 2 divisors, whose sum is σ = 1350245356052. Its totient is φ = 1350245356050.

The previous prime is 1350245356003. The next prime is 1350245356063. The reversal of 1350245356051 is 1506535420531.

It is a happy number.

It is a strong prime.

It is an emirp because it is prime and its reverse (1506535420531) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1350245356051 - 213 = 1350245347859 is a prime.

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

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

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

Almost surely, 21350245356051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 270000, while the sum is 40.

The spelling of 1350245356051 in words is "one trillion, three hundred fifty billion, two hundred forty-five million, three hundred fifty-six thousand, fifty-one".