Base | Representation |
---|---|
bin | 110111111101… |
… | …011111001100 |
3 | 1000121022010220 |
4 | 313331133030 |
5 | 12223413042 |
6 | 1242231340 |
7 | 235456005 |
oct | 67753714 |
9 | 30538126 |
10 | 14669772 |
11 | 830a687 |
12 | 4ab5550 |
13 | 3068250 |
14 | 1d3c1ac |
15 | 144b8ec |
hex | dfd7cc |
14669772 has 48 divisors (see below), whose sum is σ = 37105152. Its totient is φ = 4484160.
The previous prime is 14669771. The next prime is 14669779. The reversal of 14669772 is 27796641.
It is not an unprimeable number, because it can be changed into a prime (14669771) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42103 + ... + 42449.
It is an arithmetic number, because the mean of its divisors is an integer number (773024).
Almost surely, 214669772 is an apocalyptic number.
14669772 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 14669772, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18552576).
14669772 is an abundant number, since it is smaller than the sum of its proper divisors (22435380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14669772 is a wasteful number, since it uses less digits than its factorization.
14669772 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 638 (or 636 counting only the distinct ones).
The product of its digits is 127008, while the sum is 42.
The square root of 14669772 is about 3830.1138364284. The cubic root of 14669772 is about 244.7979564313.
The spelling of 14669772 in words is "fourteen million, six hundred sixty-nine thousand, seven hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •