Search a number
-
+
14211015461 is a prime number
BaseRepresentation
bin11010011110000101…
…01110001100100101
31100200101112101100222
431033002232030211
5213101004443321
610310051214125
71012106431646
oct151702561445
940611471328
1014211015461
116032825285
1229072a7345
131456251cb6
1498b5256cd
155829163ab
hex34f0ae325

14211015461 has 2 divisors, whose sum is σ = 14211015462. Its totient is φ = 14211015460.

The previous prime is 14211015407. The next prime is 14211015473. The reversal of 14211015461 is 16451011241.

14211015461 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., 7873900225 + 6337115236 = 88735^2 + 79606^2 .

It is a cyclic number.

It is not a de Polignac number, because 14211015461 - 26 = 14211015397 is a prime.

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

It is a congruent number.

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

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

Almost surely, 214211015461 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 960, while the sum is 26.

The spelling of 14211015461 in words is "fourteen billion, two hundred eleven million, fifteen thousand, four hundred sixty-one".