Search a number
-
+
10104961549 is a prime number
BaseRepresentation
bin10010110100100110…
…10111101000001101
3222002020021020022011
421122103113220031
5131143332232144
64350412221221
7505260520204
oct113223275015
928066236264
1010104961549
114315a951a1
121b6016a811
13c5067a3b7
146bc08623b
153e21e2a34
hex25a4d7a0d

10104961549 has 2 divisors, whose sum is σ = 10104961550. Its totient is φ = 10104961548.

The previous prime is 10104961547. The next prime is 10104961631. The reversal of 10104961549 is 94516940101.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5287907524 + 4817054025 = 72718^2 + 69405^2 .

It is a cyclic number.

It is not a de Polignac number, because 10104961549 - 21 = 10104961547 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 210104961549 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10104961549 in words is "ten billion, one hundred four million, nine hundred sixty-one thousand, five hundred forty-nine".