Base | Representation |
---|---|
bin | 110011100001… |
… | …101010101011 |
3 | 221102020110021 |
4 | 303201222223 |
5 | 11424212433 |
6 | 1201301311 |
7 | 222544501 |
oct | 63415253 |
9 | 27366407 |
10 | 13507243 |
11 | 7696212 |
12 | 4634837 |
13 | 2a4c069 |
14 | 1b18671 |
15 | 12bc22d |
hex | ce1aab |
13507243 has 8 divisors (see below), whose sum is σ = 14040000. Its totient is φ = 12979008.
The previous prime is 13507237. The next prime is 13507259. The reversal of 13507243 is 34270531.
13507243 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 13507243 - 25 = 13507211 is a prime.
It is a super-2 number, since 2×135072432 = 364891226922098, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13507213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5758 + ... + 7756.
It is an arithmetic number, because the mean of its divisors is an integer number (1755000).
Almost surely, 213507243 is an apocalyptic number.
13507243 is a deficient number, since it is larger than the sum of its proper divisors (532757).
13507243 is a wasteful number, since it uses less digits than its factorization.
13507243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2261.
The product of its (nonzero) digits is 2520, while the sum is 25.
The square root of 13507243 is about 3675.2201294616. The cubic root of 13507243 is about 238.1527336849.
Adding to 13507243 its reverse (34270531), we get a palindrome (47777774).
The spelling of 13507243 in words is "thirteen million, five hundred seven thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •