Base | Representation |
---|---|
bin | 110010101101… |
… | …001110100101 |
3 | 221000022211002 |
4 | 302231032211 |
5 | 11400324303 |
6 | 1152523045 |
7 | 220661336 |
oct | 62551645 |
9 | 27008732 |
10 | 13292453 |
11 | 75598a9 |
12 | 4550485 |
13 | 29a5375 |
14 | 1aa028d |
15 | 1278788 |
hex | cad3a5 |
13292453 has 8 divisors (see below), whose sum is σ = 14340888. Its totient is φ = 12273664.
The previous prime is 13292443. The next prime is 13292467. The reversal of 13292453 is 35429231.
It can be written as a sum of positive squares in 4 ways, for example, as 4870849 + 8421604 = 2207^2 + 2902^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13292453 - 24 = 13292437 is a prime.
It is a super-4 number, since 4×132924534 (a number of 30 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13292443) 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, 6476 + ... + 8277.
It is an arithmetic number, because the mean of its divisors is an integer number (1792611).
Almost surely, 213292453 is an apocalyptic number.
It is an amenable number.
13292453 is a deficient number, since it is larger than the sum of its proper divisors (1048435).
13292453 is a wasteful number, since it uses less digits than its factorization.
13292453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14823.
The product of its digits is 6480, while the sum is 29.
The square root of 13292453 is about 3645.8816492037. The cubic root of 13292453 is about 236.8836272248.
The spelling of 13292453 in words is "thirteen million, two hundred ninety-two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •