Base | Representation |
---|---|
bin | 110100111000… |
… | …001001101100 |
3 | 222002020101022 |
4 | 310320021230 |
5 | 12022031414 |
6 | 1213033312 |
7 | 225551330 |
oct | 64701154 |
9 | 28066338 |
10 | 13861484 |
11 | 790837a |
12 | 4785838 |
13 | 2b44380 |
14 | 1bab7c0 |
15 | 133c18e |
hex | d3826c |
13861484 has 48 divisors (see below), whose sum is σ = 30209088. Its totient is φ = 5419008.
The previous prime is 13861451. The next prime is 13861487. The reversal of 13861484 is 48416831.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13861487) 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, 40964 + ... + 41300.
It is an arithmetic number, because the mean of its divisors is an integer number (629356).
Almost surely, 213861484 is an apocalyptic number.
13861484 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13861484, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15104544).
13861484 is an abundant number, since it is smaller than the sum of its proper divisors (16347604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13861484 is a wasteful number, since it uses less digits than its factorization.
13861484 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 474 (or 472 counting only the distinct ones).
The product of its digits is 18432, while the sum is 35.
The square root of 13861484 is about 3723.1013953423. The cubic root of 13861484 is about 240.2167255292.
The spelling of 13861484 in words is "thirteen million, eight hundred sixty-one thousand, four hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.186 sec. • engine limits •