Base | Representation |
---|---|
bin | 100000001101… |
… | …1110101011110 |
3 | 1011210011102010 |
4 | 1000123311132 |
5 | 13311004410 |
6 | 1402012050 |
7 | 263400366 |
oct | 100336536 |
9 | 34704363 |
10 | 16891230 |
11 | 95976a4 |
12 | 57a7026 |
13 | 3665415 |
14 | 23599a6 |
15 | 1739c20 |
hex | 101bd5e |
16891230 has 16 divisors (see below), whose sum is σ = 40539024. Its totient is φ = 4504320.
The previous prime is 16891219. The next prime is 16891241. The reversal of 16891230 is 3219861.
16891230 = 18362 + 18372 + ... + 18402.
It is an interprime number because it is at equal distance from previous prime (16891219) and next prime (16891241).
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 563041 = 16891230 / (1 + 6 + 8 + 9 + 1 + 2 + 3 + 0).
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 7 ways as a sum of consecutive naturals, for example, 281491 + ... + 281550.
It is an arithmetic number, because the mean of its divisors is an integer number (2533689).
Almost surely, 216891230 is an apocalyptic number.
16891230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16891230 is an abundant number, since it is smaller than the sum of its proper divisors (23647794).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16891230 is a wasteful number, since it uses less digits than its factorization.
16891230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 563051.
The product of its (nonzero) digits is 2592, while the sum is 30.
The square root of 16891230 is about 4109.8941592211. The cubic root of 16891230 is about 256.5785964963.
The spelling of 16891230 in words is "sixteen million, eight hundred ninety-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •