Nerdulator> put something in

Recognised as Number

19,829

  • Positive
  • Odd
  • Composite
  • 5 digits

19,829 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value19,829
Digit count5
Digit sum29
Digit product1,296
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation79 × 251
Distinct prime factors279, 251
Number of divisors4
Sum of divisors σ(n)20,160
Aliquot sum331sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)19,500integers below n that share no factor with it
Carmichael function λ(n)9,750the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 19,500
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 79, 251, 19,8294 in total

Arithmetic

Previous number19,828
Next number19,830
Double39,658
Square root140.815482103≈irrational, shown to 9 decimal places
Cube root27.066593732≈
Negation-19,829
Reciprocal0.0000504312≈

Representations

Decimal19,829
Binary10011010111010115 bits
Octal46565
Hexadecimal4D75
Base 36FAT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnineteen thousand, eight hundred and twenty-nine
Ordinalnineteen thousand, eight hundred and twenty-ninth
Scientific notation1.9829 × 10^4
Engineering notation19.829 × 10^3

In other bases

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

Bit-level

0100110101110101
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 odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes24d 75
Gray code110101111001111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0100110101110101
32-bit00000000000000000100110101110101
64-bit0000000000000000000000000000000000000000000000000100110101110101
One's complement1011001010001010at 16 bits, every bit flipped
Bits reversed1010111010110010at 16 bits
Rotated left by 11001101011101010at 16 bits, wrapping
Shifted left by 11001101011101010= 39,658, no wrap
Shifted right by 110011010111010= 9,914, discarding the low bit
These bits as a double9.79682769 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime19,841+12
Previous prime19,819−10
Distance to nearest prime10
Nearest square below19,600
Nearest square above19,881

Powers & multiples

19,829 to the power 2393,189,241
19,829 to the power 37,796,549,459,789
19,829 to the power 4154,597,779,238,156,081
19,829 to the power 53,065,519,364,513,396,930,149
First ten multiples19,829, 39,658, 59,487, 79,316, 99,145, 118,974, 138,803, 158,632, 178,461, 198,290
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1136the total stopping time
Highest value reached59,4883× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps19,829 → 59,488 → 29,744 → 14,872 → 7,436 → 3,718 → 1,859 → 5,578 → 2,789 → 8,368 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,982,900%
19,829% as a decimal198.29
19,829% of 10019,829
19,829% of 1,000198,290
As a fraction of 10019,829/100

Read another way

As bytes19.364 KiB
As a 24-bit colour#004D75

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