Base | Representation |
---|---|
bin | 110101001000… |
… | …001101010110 |
3 | 222012120121020 |
4 | 311020031112 |
5 | 12031133004 |
6 | 1214302010 |
7 | 226244145 |
oct | 65101526 |
9 | 28176536 |
10 | 13927254 |
11 | 7952830 |
12 | 47b7906 |
13 | 2b682a3 |
14 | 1bc775c |
15 | 13518d9 |
hex | d48356 |
13927254 has 32 divisors (see below), whose sum is σ = 30741120. Its totient is φ = 4171200.
The previous prime is 13927253. The next prime is 13927273. The reversal of 13927254 is 45272931.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13927253) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 4689 + ... + 7059.
It is an arithmetic number, because the mean of its divisors is an integer number (960660).
Almost surely, 213927254 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13927254, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15370560).
13927254 is an abundant number, since it is smaller than the sum of its proper divisors (16813866).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13927254 is a wasteful number, since it uses less digits than its factorization.
13927254 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2476.
The product of its digits is 15120, while the sum is 33.
The square root of 13927254 is about 3731.9236326592. The cubic root of 13927254 is about 240.5960531660.
It can be divided in two parts, 1392 and 7254, that added together give a triangular number (8646 = T131).
The spelling of 13927254 in words is "thirteen million, nine hundred twenty-seven thousand, two hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •