Base | Representation |
---|---|
bin | 100010110100… |
… | …0000011000000 |
3 | 1021100021222211 |
4 | 1011220003000 |
5 | 14133030333 |
6 | 1451111504 |
7 | 311065510 |
oct | 105500300 |
9 | 37307884 |
10 | 18251968 |
11 | a336a79 |
12 | 6142594 |
13 | 3a208a7 |
14 | 25d1840 |
15 | 1907ecd |
hex | 11680c0 |
18251968 has 56 divisors (see below), whose sum is σ = 41842944. Its totient is φ = 7737600.
The previous prime is 18251957. The next prime is 18251977. The reversal of 18251968 is 86915281.
It is a tau number, because it is divible by the number of its divisors (56).
It is a super-3 number, since 3×182519683 (a number of 23 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 18251968.
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 7 ways as a sum of consecutive naturals, for example, 58533 + ... + 58843.
Almost surely, 218251968 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 18251968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20921472).
18251968 is an abundant number, since it is smaller than the sum of its proper divisors (23590976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18251968 is a wasteful number, since it uses less digits than its factorization.
18251968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 461 (or 451 counting only the distinct ones).
The product of its digits is 34560, while the sum is 40.
The square root of 18251968 is about 4272.2322034271. The cubic root of 18251968 is about 263.2913347894.
The spelling of 18251968 in words is "eighteen million, two hundred fifty-one thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •