Search a number
-
+
2651270276731 is a prime number
BaseRepresentation
bin100110100101001100000…
…001011110011001111011
3100101110101120202211011111
4212211030001132121323
5321414300142323411
65345550551141151
7362355643342366
oct46451401363173
910343346684144
102651270276731
11932440a5310a
12369a010747b7
1316302419051b
14924720490dd
1548e73ead721
hex2694c05e67b

2651270276731 has 2 divisors, whose sum is σ = 2651270276732. Its totient is φ = 2651270276730.

The previous prime is 2651270276713. The next prime is 2651270276791. The reversal of 2651270276731 is 1376720721562.

2651270276731 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 2651270276731 - 223 = 2651261888123 is a prime.

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

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

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

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

Almost surely, 22651270276731 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1481760, while the sum is 49.

The spelling of 2651270276731 in words is "two trillion, six hundred fifty-one billion, two hundred seventy million, two hundred seventy-six thousand, seven hundred thirty-one".