Search a number
-
+
1451113256029 is a prime number
BaseRepresentation
bin10101000111011101000…
…101110001010001011101
312010201120120121020021111
4111013131011301101131
5142233334443143104
63030344321102021
7206560640106133
oct25073505612135
95121516536244
101451113256029
1150a46066a048
121b529aa87911
13a6abb1b9178
145033cb29753
1527b30608404
hex151dd17145d

1451113256029 has 2 divisors, whose sum is σ = 1451113256030. Its totient is φ = 1451113256028.

The previous prime is 1451113255997. The next prime is 1451113256051. The reversal of 1451113256029 is 9206523111541.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 797586527929 + 653526728100 = 893077^2 + 808410^2 .

It is a cyclic number.

It is not a de Polignac number, because 1451113256029 - 25 = 1451113255997 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 21451113256029 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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