Base | Representation |
---|---|
bin | 110011001101… |
… | …110111011111 |
3 | 221021010012120 |
4 | 303031313133 |
5 | 11414114033 |
6 | 1155434023 |
7 | 222056163 |
oct | 63156737 |
9 | 27233176 |
10 | 13426143 |
11 | 7640295 |
12 | 45b5913 |
13 | 2a21183 |
14 | 1ad6ca3 |
15 | 12a31b3 |
hex | ccdddf |
13426143 has 8 divisors (see below), whose sum is σ = 17948208. Its totient is φ = 8927424.
The previous prime is 13426121. The next prime is 13426187. The reversal of 13426143 is 34162431.
13426143 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13426143 - 210 = 13425119 is a prime.
It is a super-2 number, since 2×134261432 = 360522631712898, which contains 22 as substring.
It is a plaindrome in base 16.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13426843) 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 in 7 ways as a sum of consecutive naturals, for example, 4446 + ... + 6827.
It is an arithmetic number, because the mean of its divisors is an integer number (2243526).
Almost surely, 213426143 is an apocalyptic number.
13426143 is a deficient number, since it is larger than the sum of its proper divisors (4522065).
13426143 is a wasteful number, since it uses less digits than its factorization.
13426143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11673.
The product of its digits is 1728, while the sum is 24.
The square root of 13426143 is about 3664.1701652625. The cubic root of 13426143 is about 237.6751387757.
Adding to 13426143 its reverse (34162431), we get a palindrome (47588574).
The spelling of 13426143 in words is "thirteen million, four hundred twenty-six thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •