Nerdulator> put something in

Recognised as Number

19,830

  • Positive
  • Even
  • Composite
  • 5 digits

19,830 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value19,830
Digit count5
Digit sum21
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 numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 5 × 661
Distinct prime factors42, 3, 5, 661
Number of divisors16
Sum of divisors σ(n)47,664
Aliquot sum27,834sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)5,280integers below n that share no factor with it
Carmichael function λ(n)660the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,280
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 5, 6, 10, 15, 30, 661, 1,322, 1,983, 3,305, 3,966, 6,610, 9,915, 19,83016 in total

Arithmetic

Previous number19,829
Next number19,831
Double39,660
Half9,915
Square root140.819032805≈irrational, shown to 9 decimal places
Cube root27.067048725≈
Negation-19,830
Reciprocal0.0000504286≈

Representations

Decimal19,830
Binary10011010111011015 bits
Octal46566
Hexadecimal4D76
Base 36FAU
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnineteen thousand, eight hundred and thirty
Ordinalnineteen thousand, eight hundred and thirtieth
Scientific notation1.983 × 10^4
Engineering notation19.83 × 10^3

In other bases

Ternary1000012110base 3; the most digit-efficient integer base after e: 10 digits
Quinary1113310base 5; one hand: 7 digits
Septenary111546base 7: 6 digits
Nonary30173base 9; each digit is two ternary digits: 5 digits
Duodecimalb586base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal29babase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal5:30:30base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10001TT110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101001010001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0100110101110110
Bit length15 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits6within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 14worth 16,384
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes24d 76
Gray code110101111001101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0100110101110110
32-bit00000000000000000100110101110110
64-bit0000000000000000000000000000000000000000000000000100110101110110
One's complement1011001010001001at 16 bits, every bit flipped
Bits reversed0110111010110010at 16 bits
Rotated left by 11001101011101100at 16 bits, wrapping
Shifted left by 11001101011101100= 39,660, no wrap
Shifted right by 110011010111011= 9,915, discarding the low bit
These bits as a double9.79732176 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime19,841+11
Previous prime19,819−11
Distance to nearest prime11
Nearest square below19,600
Nearest square above19,881

Powers & multiples

19,830 to the power 2393,228,900
19,830 to the power 37,797,729,087,000
19,830 to the power 4154,628,967,795,210,000
19,830 to the power 53,066,292,431,379,014,300,000
First ten multiples19,830, 39,660, 59,490, 79,320, 99,150, 118,980, 138,810, 158,640, 178,470, 198,300
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 148the total stopping time
Highest value reached50,2002× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps19,830 → 9,915 → 29,746 → 14,873 → 44,620 → 22,310 → 11,155 → 33,466 → 16,733 → 50,200 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,983,000%
19,830% as a decimal198.3
19,830% of 10019,830
19,830% of 1,000198,300
As a fraction of 10019,830/100

Read another way

As bytes19.365 KiB
As a 24-bit colour#004D76

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 “19830” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.