Base | Representation |
---|---|
bin | 110011010100… |
… | …100110001001 |
3 | 221022112000101 |
4 | 303110212021 |
5 | 11421004310 |
6 | 1200205401 |
7 | 222232426 |
oct | 63244611 |
9 | 27275011 |
10 | 13453705 |
11 | 7659a71 |
12 | 4609861 |
13 | 2a30895 |
14 | 1b02d4d |
15 | 12ab43a |
hex | cd4989 |
13453705 has 8 divisors (see below), whose sum is σ = 16304904. Its totient is φ = 10656000.
The previous prime is 13453697. The next prime is 13453723. The reversal of 13453705 is 50735431.
13453705 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 1565001 + 11888704 = 1251^2 + 3448^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13453705 - 23 = 13453697 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12816 + ... + 13825.
It is an arithmetic number, because the mean of its divisors is an integer number (2038113).
Almost surely, 213453705 is an apocalyptic number.
It is an amenable number.
13453705 is a deficient number, since it is larger than the sum of its proper divisors (2851199).
13453705 is a wasteful number, since it uses less digits than its factorization.
13453705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26747.
The product of its (nonzero) digits is 6300, while the sum is 28.
The square root of 13453705 is about 3667.9292523166. The cubic root of 13453705 is about 237.8376655875.
It can be divided in two parts, 1345 and 3705, that added together give a triangular number (5050 = T100).
The spelling of 13453705 in words is "thirteen million, four hundred fifty-three thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •