Search a number
-
+
14546611553 is a prime number
BaseRepresentation
bin11011000110000101…
…11010110101100001
31101112210000102122212
431203002322311201
5214242413032203
610403240211505
71023323105135
oct154302726541
941483012585
1014546611553
116195201621
12299b769b95
1314aa933c76
149bdd233c5
155a21071d8
hex3630bad61

14546611553 has 2 divisors, whose sum is σ = 14546611554. Its totient is φ = 14546611552.

The previous prime is 14546611543. The next prime is 14546611643. The reversal of 14546611553 is 35511664541.

14546611553 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., 14064062464 + 482549089 = 118592^2 + 21967^2 .

It is a cyclic number.

It is not a de Polignac number, because 14546611553 - 28 = 14546611297 is a prime.

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

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

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

Almost surely, 214546611553 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 216000, while the sum is 41.

The spelling of 14546611553 in words is "fourteen billion, five hundred forty-six million, six hundred eleven thousand, five hundred fifty-three".