Search a number
-
+
1403050697 is a prime number
BaseRepresentation
bin101001110100000…
…1101101011001001
310121210002100201122
41103220031223021
510333140110242
6351120125025
746524506546
oct12350155311
93553070648
101403050697
1165aa92834
12331a66775
131948a9219
14d44a7bcd
1583298ad2
hex53a0dac9

1403050697 has 2 divisors, whose sum is σ = 1403050698. Its totient is φ = 1403050696.

The previous prime is 1403050679. The next prime is 1403050771. The reversal of 1403050697 is 7960503041.

Together with previous prime (1403050679) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1284218896 + 118831801 = 35836^2 + 10901^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1403050697 - 26 = 1403050633 is a prime.

It is a super-3 number, since 3×14030506973 (a number of 28 digits) contains 333 as substring.

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

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

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

Almost surely, 21403050697 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 22680, while the sum is 35.

The square root of 1403050697 is about 37457.3183370086. The cubic root of 1403050697 is about 1119.5009194863.

The spelling of 1403050697 in words is "one billion, four hundred three million, fifty thousand, six hundred ninety-seven".