Base | Representation |
---|---|
bin | 110110100110… |
… | …001001110100 |
3 | 222221010110000 |
4 | 312212021310 |
5 | 12130441202 |
6 | 1230431300 |
7 | 232436046 |
oct | 66461164 |
9 | 28833400 |
10 | 14312052 |
11 | 8095947 |
12 | 4962530 |
13 | 2c71491 |
14 | 1c87a96 |
15 | 13ca91c |
hex | da6274 |
14312052 has 60 divisors (see below), whose sum is σ = 37782976. Its totient is φ = 4723920.
The previous prime is 14312047. The next prime is 14312069. The reversal of 14312052 is 25021341.
14312052 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 52677 + ... + 52947.
Almost surely, 214312052 is an apocalyptic number.
14312052 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 14312052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18891488).
14312052 is an abundant number, since it is smaller than the sum of its proper divisors (23470924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14312052 is a wasteful number, since it uses less digits than its factorization.
14312052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 450 (or 439 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 14312052 is about 3783.1272777954. The cubic root of 14312052 is about 242.7917740691.
Adding to 14312052 its reverse (25021341), we get a palindrome (39333393).
The spelling of 14312052 in words is "fourteen million, three hundred twelve thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •