Base | Representation |
---|---|
bin | 110011011101… |
… | …100111010101 |
3 | 221101101200112 |
4 | 303131213111 |
5 | 11423200040 |
6 | 1201052405 |
7 | 222445220 |
oct | 63354725 |
9 | 27341615 |
10 | 13490645 |
11 | 76847a3 |
12 | 4627105 |
13 | 2a4463c |
14 | 1b125b7 |
15 | 12b7365 |
hex | cdd9d5 |
13490645 has 32 divisors (see below), whose sum is σ = 19353600. Its totient is φ = 8836416.
The previous prime is 13490641. The next prime is 13490657. The reversal of 13490645 is 54609431.
It is a cyclic number.
It is not a de Polignac number, because 13490645 - 22 = 13490641 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13490641) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 96986 + ... + 97124.
It is an arithmetic number, because the mean of its divisors is an integer number (604800).
Almost surely, 213490645 is an apocalyptic number.
It is an amenable number.
13490645 is a deficient number, since it is larger than the sum of its proper divisors (5862955).
13490645 is a wasteful number, since it uses less digits than its factorization.
13490645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257.
The product of its (nonzero) digits is 12960, while the sum is 32.
The square root of 13490645 is about 3672.9613393010. The cubic root of 13490645 is about 238.0551445791.
The spelling of 13490645 in words is "thirteen million, four hundred ninety thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •