Base | Representation |
---|---|
bin | 11001010101110000… |
… | …10111100000101011 |
3 | 1022010002221010110201 |
4 | 30222320113200223 |
5 | 210330201240243 |
6 | 10125535453031 |
7 | 661061552245 |
oct | 145270274053 |
9 | 38102833421 |
10 | 13604321323 |
11 | 5851314a6a |
12 | 2778087177 |
13 | 138a651498 |
14 | 930b19095 |
15 | 54952504d |
hex | 32ae1782b |
13604321323 has 2 divisors, whose sum is σ = 13604321324. Its totient is φ = 13604321322.
The previous prime is 13604321317. The next prime is 13604321329. The reversal of 13604321323 is 32312340631.
13604321323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (13604321317) and next prime (13604321329).
It is a cyclic number.
It is not a de Polignac number, because 13604321323 - 229 = 13067450411 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13604321291 and 13604321300.
It is not a weakly prime, because it can be changed into another prime (13604321329) 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, 6802160661 + 6802160662.
It is an arithmetic number, because the mean of its divisors is an integer number (6802160662).
Almost surely, 213604321323 is an apocalyptic number.
13604321323 is a deficient number, since it is larger than the sum of its proper divisors (1).
13604321323 is an equidigital number, since it uses as much as digits as its factorization.
13604321323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 13604321323 its reverse (32312340631), we get a palindrome (45916661954).
The spelling of 13604321323 in words is "thirteen billion, six hundred four million, three hundred twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •