Search a number
-
+
6915045127 is a prime number
BaseRepresentation
bin1100111000010101…
…10011011100000111
3122211220212200121111
412130022303130013
5103130222421002
63102101225451
7333234625264
oct63412633407
918756780544
106915045127
112a293a9831
12140ba02287
1386282c4a3
1449856426b
152a71373d7
hex19c2b3707

6915045127 has 2 divisors, whose sum is σ = 6915045128. Its totient is φ = 6915045126.

The previous prime is 6915045113. The next prime is 6915045131. The reversal of 6915045127 is 7215405196.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 6915045127 - 227 = 6780827399 is a prime.

It is a super-2 number, since 2×69150451272 = 95635698216892892258, which contains 22 as substring.

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

It is a congruent number.

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

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

Almost surely, 26915045127 is an apocalyptic number.

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

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

6915045127 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 40.

The square root of 6915045127 is about 83156.7503393441. The cubic root of 6915045127 is about 1905.1609572760.

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