Base | Representation |
---|---|
bin | 100010101100… |
… | …1000000100000 |
3 | 1021020011111100 |
4 | 1011121000200 |
5 | 14124042433 |
6 | 1445514400 |
7 | 310421100 |
oct | 105310040 |
9 | 37204440 |
10 | 18190368 |
11 | a2a4769 |
12 | 6112a00 |
13 | 39cb841 |
14 | 25b7200 |
15 | 18e4b13 |
hex | 1159020 |
18190368 has 108 divisors (see below), whose sum is σ = 60221070. Its totient is φ = 5193216.
The previous prime is 18190351. The next prime is 18190373. The reversal of 18190368 is 86309181.
It can be written as a sum of positive squares in only one way, i.e., 13046544 + 5143824 = 3612^2 + 2268^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
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 17 ways as a sum of consecutive naturals, for example, 13468 + ... + 14756.
Almost surely, 218190368 is an apocalyptic number.
18190368 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 18190368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30110535).
18190368 is an abundant number, since it is smaller than the sum of its proper divisors (42030702).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18190368 is a wasteful number, since it uses less digits than its factorization.
18190368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1319 (or 1301 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 36.
The square root of 18190368 is about 4265.0167643281. The cubic root of 18190368 is about 262.9948000726.
The spelling of 18190368 in words is "eighteen million, one hundred ninety thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •