Search a number
-
+
457103113 is a prime number
BaseRepresentation
bin11011001111101…
…101011100001001
31011212010020120221
4123033231130021
51414004244423
6113205150041
714220212065
oct3317553411
91155106527
10457103113
11215028375
121090bb321
1373915b1c
14449caaa5
152a1e2e5d
hex1b3ed709

457103113 has 2 divisors, whose sum is σ = 457103114. Its totient is φ = 457103112.

The previous prime is 457103107. The next prime is 457103189. The reversal of 457103113 is 311301754.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 358458489 + 98644624 = 18933^2 + 9932^2 .

It is a cyclic number.

It is not a de Polignac number, because 457103113 - 29 = 457102601 is a prime.

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

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

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

Almost surely, 2457103113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1260, while the sum is 25.

The square root of 457103113 is about 21379.9699017562. The cubic root of 457103113 is about 770.3203889626.

Adding to 457103113 its reverse (311301754), we get a palindrome (768404867).

It can be divided in two parts, 4571031 and 13, that added together give a square (4571044 = 21382).

The spelling of 457103113 in words is "four hundred fifty-seven million, one hundred three thousand, one hundred thirteen".