Base | Representation |
---|---|
bin | 111101011000… |
… | …010101111000 |
3 | 1010021111000000 |
4 | 331120111320 |
5 | 13104343423 |
6 | 1332513000 |
7 | 253524021 |
oct | 75302570 |
9 | 33244000 |
10 | 16090488 |
11 | 90a0027 |
12 | 547b760 |
13 | 3444acb |
14 | 21cbc48 |
15 | 162c843 |
hex | f58578 |
16090488 has 112 divisors (see below), whose sum is σ = 47217600. Its totient is φ = 5132160.
The previous prime is 16090453. The next prime is 16090499. The reversal of 16090488 is 88409061.
It is a happy number.
16090488 is a `hidden beast` number, since 1 + 609 + 0 + 48 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 180748 + ... + 180836.
Almost surely, 216090488 is an apocalyptic number.
16090488 is a gapful number since it is divisible by the number (18) 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 16090488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23608800).
16090488 is an abundant number, since it is smaller than the sum of its proper divisors (31127112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16090488 is an equidigital number, since it uses as much as digits as its factorization.
16090488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144 (or 125 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 36.
The square root of 16090488 is about 4011.2950527230. The cubic root of 16090488 is about 252.4583495003.
The spelling of 16090488 in words is "sixteen million, ninety thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •