Base | Representation |
---|---|
bin | 110101100111… |
… | …011101111000 |
3 | 222110002020020 |
4 | 311213131320 |
5 | 12044232123 |
6 | 1221130440 |
7 | 230316342 |
oct | 65473570 |
9 | 28402206 |
10 | 14055288 |
11 | 7a2aa45 |
12 | 4859a20 |
13 | 2bb1650 |
14 | 1c1c292 |
15 | 13797e3 |
hex | d67778 |
14055288 has 64 divisors (see below), whose sum is σ = 39849600. Its totient is φ = 4095360.
The previous prime is 14055287. The next prime is 14055289. The reversal of 14055288 is 88255041.
It is an interprime number because it is at equal distance from previous prime (14055287) and next prime (14055289).
It is a super-2 number, since 2×140552882 = 395102241525888, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14055287) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4743 + ... + 7113.
It is an arithmetic number, because the mean of its divisors is an integer number (622650).
Almost surely, 214055288 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14055288, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19924800).
14055288 is an abundant number, since it is smaller than the sum of its proper divisors (25794312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14055288 is a wasteful number, since it uses less digits than its factorization.
14055288 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2412 (or 2408 counting only the distinct ones).
The product of its (nonzero) digits is 12800, while the sum is 33.
The square root of 14055288 is about 3749.0382766784. The cubic root of 14055288 is about 241.3310762247.
The spelling of 14055288 in words is "fourteen million, fifty-five thousand, two hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •