Base | Representation |
---|---|
bin | 100000010001… |
… | …1101000010001 |
3 | 1011211210012110 |
4 | 1000203220101 |
5 | 13313020103 |
6 | 1402415533 |
7 | 263562432 |
oct | 100435021 |
9 | 34753173 |
10 | 16923153 |
11 | 9609685 |
12 | 58015a9 |
13 | 3676b00 |
14 | 2367489 |
15 | 1744403 |
hex | 1023a11 |
16923153 has 24 divisors (see below), whose sum is σ = 25297920. Its totient is φ = 10046400.
The previous prime is 16923139. The next prime is 16923161. The reversal of 16923153 is 35132961.
It is not a de Polignac number, because 16923153 - 212 = 16919057 is a prime.
It is a super-2 number, since 2×169231532 = 572786214922818, which contains 22 as substring.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 16923153.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16923133) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14128 + ... + 15278.
It is an arithmetic number, because the mean of its divisors is an integer number (1054080).
Almost surely, 216923153 is an apocalyptic number.
16923153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
16923153 is a deficient number, since it is larger than the sum of its proper divisors (8374767).
16923153 is a wasteful number, since it uses less digits than its factorization.
16923153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1209 (or 1196 counting only the distinct ones).
The product of its digits is 4860, while the sum is 30.
The square root of 16923153 is about 4113.7760026526. The cubic root of 16923153 is about 256.7401320781.
The spelling of 16923153 in words is "sixteen million, nine hundred twenty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •