Search a number
-
+
102510462230641 is a prime number
BaseRepresentation
bin10111010011101110010011…
…101011111110000001110001
3111102221220102100220110212001
4113103232103223332001301
5101414012411312340031
61002004353424534001
730410064550051063
oct2723562353760161
9442856370813761
10102510462230641
112a73249653a163
12b5b726a481301
1345279062051aa
141b457661ab733
15bcb7ebb45861
hex5d3b93afe071

102510462230641 has 2 divisors, whose sum is σ = 102510462230642. Its totient is φ = 102510462230640.

The previous prime is 102510462230639. The next prime is 102510462230647. The reversal of 102510462230641 is 146032264015201.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 102388798000225 + 121664230416 = 10118735^2 + 348804^2 .

It is a cyclic number.

It is not a de Polignac number, because 102510462230641 - 21 = 102510462230639 is a prime.

Together with 102510462230639, it forms a pair of twin primes.

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

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

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

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

Almost surely, 2102510462230641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 69120, while the sum is 37.

The spelling of 102510462230641 in words is "one hundred two trillion, five hundred ten billion, four hundred sixty-two million, two hundred thirty thousand, six hundred forty-one".