Search a number
-
+
10132435361 is a prime number
BaseRepresentation
bin10010110111111000…
…01011000110100001
3222011010222001021202
421123330023012201
5131222400412421
64353233130545
7506043164606
oct113374130641
928133861252
1010132435361
11432a54a724
121b693b9a55
13c562795a9
146c19986ad
153e481d10b
hex25bf0b1a1

10132435361 has 2 divisors, whose sum is σ = 10132435362. Its totient is φ = 10132435360.

The previous prime is 10132435321. The next prime is 10132435363. The reversal of 10132435361 is 16353423101.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8157521761 + 1974913600 = 90319^2 + 44440^2 .

It is a cyclic number.

It is not a de Polignac number, because 10132435361 - 214 = 10132418977 is a prime.

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

It is a Chen prime.

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

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

Almost surely, 210132435361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6480, while the sum is 29.

Adding to 10132435361 its reverse (16353423101), we get a palindrome (26485858462).

The spelling of 10132435361 in words is "ten billion, one hundred thirty-two million, four hundred thirty-five thousand, three hundred sixty-one".