Base | Representation |
---|---|
bin | 1100001101010110001011… |
… | …0110011011001101100011 |
3 | 1202112021020000001221020201 |
4 | 3003111202312123031203 |
5 | 3224412141344000103 |
6 | 44314350021250031 |
7 | 2553545065613221 |
oct | 303254266331543 |
9 | 52467200057221 |
10 | 13423431234403 |
11 | 4305932a90323 |
12 | 1609673b63917 |
13 | 764a93811ca8 |
14 | 3459aa08bb11 |
15 | 18429317351d |
hex | c3562d9b363 |
13423431234403 has 2 divisors, whose sum is σ = 13423431234404. Its totient is φ = 13423431234402.
The previous prime is 13423431234401. The next prime is 13423431234547. The reversal of 13423431234403 is 30443213432431.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13423431234403 - 21 = 13423431234401 is a prime.
It is a super-2 number, since 2×134234312344032 (a number of 27 digits) contains 22 as substring.
Together with 13423431234401, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (13423431234401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6711715617201 + 6711715617202.
It is an arithmetic number, because the mean of its divisors is an integer number (6711715617202).
Almost surely, 213423431234403 is an apocalyptic number.
13423431234403 is a deficient number, since it is larger than the sum of its proper divisors (1).
13423431234403 is an equidigital number, since it uses as much as digits as its factorization.
13423431234403 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 248832, while the sum is 37.
Adding to 13423431234403 its reverse (30443213432431), we get a palindrome (43866644666834).
The spelling of 13423431234403 in words is "thirteen trillion, four hundred twenty-three billion, four hundred thirty-one million, two hundred thirty-four thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •