Nerdulator> put something in

Recognised as Number

10,182

  • Positive
  • Even
  • Composite
  • 5 digits

10,182 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value10,182
Digit count5
Digit sum12
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 1,697
Distinct prime factors32, 3, 1,697
Number of divisors8
Sum of divisors σ(n)20,376
Aliquot sum10,194sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)3,392integers below n that share no factor with it
Carmichael function λ(n)1,696the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,392
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 1,697, 3,394, 5,091, 10,1828 in total

Arithmetic

Previous number10,181
Next number10,183
Double20,364
Half5,091
Square root100.905896755≈irrational, shown to 9 decimal places
Cube root21.674264265≈
Negation-10,182
Reciprocal0.0000982125≈

Representations

Decimal10,182
Binary1001111100011014 bits
Octal23706
Hexadecimal27C6
Base 367UU
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsten thousand, one hundred and eighty-two
Ordinalten thousand, one hundred and eighty-second
Scientific notation1.0182 × 10^4
Engineering notation10.182 × 10^3

In other bases

Ternary111222010base 3; the most digit-efficient integer base after e: 9 digits
Quinary311212base 5; one hand: 6 digits
Septenary41454base 7: 5 digits
Nonary14863base 9; each digit is two ternary digits: 5 digits
Duodecimal5a86base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1592base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal2:49:42base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TTT00T010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111100011011010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0010011111000110
Bit length14 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits6within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 13worth 8,192
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes227 c6
Gray code11010000100101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0010011111000110
32-bit00000000000000000010011111000110
64-bit0000000000000000000000000000000000000000000000000010011111000110
One's complement1101100000111001at 16 bits, every bit flipped
Bits reversed0110001111100100at 16 bits
Rotated left by 10100111110001100at 16 bits, wrapping
Shifted left by 1100111110001100= 20,364, no wrap
Shifted right by 11001111100011= 5,091, discarding the low bit
These bits as a double5.03057641 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime10,193+11
Previous prime10,181−1
Distance to nearest prime1
Nearest square below10,000
Nearest square above10,201

Powers & multiples

10,182 to the power 2103,673,124
10,182 to the power 31,055,599,748,568
10,182 to the power 410,748,116,639,919,376
10,182 to the power 5109,437,323,627,659,086,432
First ten multiples10,182, 20,364, 30,546, 40,728, 50,910, 61,092, 71,274, 81,456, 91,638, 101,820
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 4
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10No, remainder 2
Divisible by 11No, remainder 7
Divisible by 12No, remainder 6
Divisible by 100No, remainder 82

Collatz (3n + 1) trajectory

Steps to reach 142the total stopping time
Highest value reached22,9122× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps10,182 → 5,091 → 15,274 → 7,637 → 22,912 → 11,456 → 5,728 → 2,864 → 1,432 → 716 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,018,200%
10,182% as a decimal101.82
10,182% of 10010,182
10,182% of 1,000101,820
As a fraction of 10010,182/100

Read another way

As bytes9.943 KiB
As a 24-bit colour#0027C6

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “10182” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.