Base | Representation |
---|---|
bin | 111000000010… |
… | …000110000010 |
3 | 1000122021000210 |
4 | 320002012002 |
5 | 12230014032 |
6 | 1242454550 |
7 | 235565013 |
oct | 70020602 |
9 | 30567023 |
10 | 14688642 |
11 | 8322881 |
12 | 4b04456 |
13 | 3073a07 |
14 | 1d4500a |
15 | 14522cc |
hex | e02182 |
14688642 has 8 divisors (see below), whose sum is σ = 29377296. Its totient is φ = 4896212.
The previous prime is 14688623. The next prime is 14688643. The reversal of 14688642 is 24688641.
It is a sphenic number, since it is the product of 3 distinct primes.
14688642 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 14688642.
It is not an unprimeable number, because it can be changed into a prime (14688643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1224048 + ... + 1224059.
It is an arithmetic number, because the mean of its divisors is an integer number (3672162).
Almost surely, 214688642 is an apocalyptic number.
14688642 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14688642 is a wasteful number, since it uses less digits than its factorization.
14688642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2448112.
The product of its digits is 73728, while the sum is 39.
The square root of 14688642 is about 3832.5764180248. The cubic root of 14688642 is about 244.9028741766.
Subtracting 14688642 from its reverse (24688641), we obtain a palindrome (9999999).
It can be divided in two parts, 146 and 88642, that added together give a palindrome (88788).
The spelling of 14688642 in words is "fourteen million, six hundred eighty-eight thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •