Search a number
-
+
1475469796421 is a prime number
BaseRepresentation
bin10101011110001000110…
…110100110010001000101
312020001110000201200110002
4111132020312212101011
5143133230231441141
63045453234211045
7211412342224025
oct25361066462105
95201400650402
101475469796421
1151981a264375
121b9b57a23a85
13a91a031b64a
14515ad855a85
15285a8a75e9b
hex15788da6445

1475469796421 has 2 divisors, whose sum is σ = 1475469796422. Its totient is φ = 1475469796420.

The previous prime is 1475469796309. The next prime is 1475469796429. The reversal of 1475469796421 is 1246979645741.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 945902130625 + 529567665796 = 972575^2 + 727714^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1475469796421 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21475469796421 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 91445760, while the sum is 65.

The spelling of 1475469796421 in words is "one trillion, four hundred seventy-five billion, four hundred sixty-nine million, seven hundred ninety-six thousand, four hundred twenty-one".