Search a number
-
+
10615643057 is a prime number
BaseRepresentation
bin10011110001011110…
…11101101110110001
31000101211012112122002
421320233131232301
5133220101034212
64513214023345
7524031322445
oct117057355661
930354175562
1010615643057
114558287828
1220831a7b55
1310024022c6
14729c1c825
15421e6aac2
hex278bddbb1

10615643057 has 2 divisors, whose sum is σ = 10615643058. Its totient is φ = 10615643056.

The previous prime is 10615643041. The next prime is 10615643063. The reversal of 10615643057 is 75034651601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8071045921 + 2544597136 = 89839^2 + 50444^2 .

It is a cyclic number.

It is not a de Polignac number, because 10615643057 - 24 = 10615643041 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 10615643057.

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

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

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

Almost surely, 210615643057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 75600, while the sum is 38.

The spelling of 10615643057 in words is "ten billion, six hundred fifteen million, six hundred forty-three thousand, fifty-seven".