Base | Representation |
---|---|
bin | 110101000100… |
… | …111111011000 |
3 | 222011220112000 |
4 | 311010333120 |
5 | 12030222242 |
6 | 1214121000 |
7 | 226160544 |
oct | 65047730 |
9 | 28156460 |
10 | 13914072 |
11 | 7943937 |
12 | 47b0160 |
13 | 2b622a3 |
14 | 1bc2a24 |
15 | 134ca4c |
hex | d44fd8 |
13914072 has 64 divisors (see below), whose sum is σ = 39717600. Its totient is φ = 4510080.
The previous prime is 13914059. The next prime is 13914073. The reversal of 13914072 is 27041931.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13914073) 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 15 ways as a sum of consecutive naturals, for example, 7122 + ... + 8862.
Almost surely, 213914072 is an apocalyptic number.
13914072 is a gapful number since it is divisible by the number (12) 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 13914072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19858800).
13914072 is an abundant number, since it is smaller than the sum of its proper divisors (25803528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13914072 is a wasteful number, since it uses less digits than its factorization.
13914072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1793 (or 1783 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The square root of 13914072 is about 3730.1571012492. The cubic root of 13914072 is about 240.5201219904.
The spelling of 13914072 in words is "thirteen million, nine hundred fourteen thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •