Base | Representation |
---|---|
bin | 110110000000… |
… | …000010000000 |
3 | 222122012020202 |
4 | 312000002000 |
5 | 12110442104 |
6 | 1223224332 |
7 | 231215600 |
oct | 66000200 |
9 | 28565222 |
10 | 14155904 |
11 | 7a995a4 |
12 | 48a80a8 |
13 | 2c18399 |
14 | 1c46c00 |
15 | 139951e |
hex | d80080 |
14155904 has 96 divisors (see below), whose sum is σ = 34244460. Its totient is φ = 5806080.
The previous prime is 14155903. The next prime is 14155907. The reversal of 14155904 is 40955141.
It can be written as a sum of positive squares in 2 ways, for example, as 14077504 + 78400 = 3752^2 + 280^2 .
It is not an unprimeable number, because it can be changed into a prime (14155903) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 232034 + ... + 232094.
Almost surely, 214155904 is an apocalyptic number.
14155904 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 14155904, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17122230).
14155904 is an abundant number, since it is smaller than the sum of its proper divisors (20088556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14155904 is an equidigital number, since it uses as much as digits as its factorization.
14155904 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126 (or 107 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 29.
The square root of 14155904 is about 3762.4332552219. The cubic root of 14155904 is about 241.9055706986.
The spelling of 14155904 in words is "fourteen million, one hundred fifty-five thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •