Base | Representation |
---|---|
bin | 111000000111… |
… | …100001010000 |
3 | 1000200101111211 |
4 | 320013201100 |
5 | 12231221424 |
6 | 1243145504 |
7 | 236016550 |
oct | 70074120 |
9 | 30611454 |
10 | 14710864 |
11 | 8338543 |
12 | 4b15294 |
13 | 3080b6c |
14 | 1d4d160 |
15 | 1458b94 |
hex | e07850 |
14710864 has 80 divisors (see below), whose sum is σ = 35553280. Its totient is φ = 5754240.
The previous prime is 14710849. The next prime is 14710877. The reversal of 14710864 is 46801741.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 65857 + ... + 66079.
It is an arithmetic number, because the mean of its divisors is an integer number (444416).
Almost surely, 214710864 is an apocalyptic number.
14710864 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 14710864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17776640).
14710864 is an abundant number, since it is smaller than the sum of its proper divisors (20842416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14710864 is a wasteful number, since it uses less digits than its factorization.
14710864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288 (or 282 counting only the distinct ones).
The product of its (nonzero) digits is 5376, while the sum is 31.
The square root of 14710864 is about 3835.4744165488. The cubic root of 14710864 is about 245.0263139861.
It can be divided in two parts, 147 and 10864, that added together give a palindrome (11011).
The spelling of 14710864 in words is "fourteen million, seven hundred ten thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •