Search a number
-
+
5615056129 is a prime number
BaseRepresentation
bin1010011101010111…
…01111010100000001
3112111022201101221211
411032223233110001
542444423244004
62325102050121
7256101122014
oct51653572401
915438641854
105615056129
112421609861
121108579941
136b63c9527
143b3a4737b
1522ce4a504
hex14eaef501

5615056129 has 2 divisors, whose sum is σ = 5615056130. Its totient is φ = 5615056128.

The previous prime is 5615056001. The next prime is 5615056189. The reversal of 5615056129 is 9216505165.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3642363904 + 1972692225 = 60352^2 + 44415^2 .

It is a cyclic number.

It is not a de Polignac number, because 5615056129 - 27 = 5615056001 is a prime.

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

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

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

Almost surely, 25615056129 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 5615056129 is about 74933.6782027948. The cubic root of 5615056129 is about 1777.3980551900.

The spelling of 5615056129 in words is "five billion, six hundred fifteen million, fifty-six thousand, one hundred twenty-nine".