Nerdulator> put something in

Recognised as Number

59,822

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value59,822
Digit count5
Digit sum26
Digit product1,440
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 7 × 4,273
Distinct prime factors32, 7, 4,273
Number of divisors8
Sum of divisors σ(n)102,576
Aliquot sum42,754sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)25,632integers below n that share no factor with it
Carmichael function λ(n)4,272the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 25,632
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 7, 14, 4,273, 8,546, 29,911, 59,8228 in total

Arithmetic

Previous number59,821
Next number59,823
Double119,644
Half29,911
Square root244.585363421≈irrational, shown to 9 decimal places
Cube root39.109924374≈
Negation-59,822
Reciprocal0.0000167163≈

Representations

Decimal59,822
Binary111010011010111016 bits
Octal164656
HexadecimalE9AE
Base 361A5Q
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-nine thousand, eight hundred and twenty-two
Ordinalfifty-nine thousand, eight hundred and twenty-second
Scientific notation5.9822 × 10^4
Engineering notation59.822 × 10^3

In other bases

Ternary10001001122base 3; the most digit-efficient integer base after e: 11 digits
Quinary3403242base 5; one hand: 7 digits
Septenary336260base 7: 6 digits
Nonary101048base 9; each digit is two ternary digits: 6 digits
Duodecimal2a752base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal79b2base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal16:37:2base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1000101TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011111011110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1110100110101110
Bit length16 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits6within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes2e9 ae
Gray code1001110101111001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1110100110101110
32-bit00000000000000001110100110101110
64-bit0000000000000000000000000000000000000000000000001110100110101110
One's complement0001011001010001at 16 bits, every bit flipped
Bits reversed0111010110010111at 16 bits
Rotated left by 11101001101011101at 16 bits, wrapping
Shifted left by 111101001101011100= 119,644, no wrap
Shifted right by 1111010011010111= 29,911, discarding the low bit
These bits as a double2.95559951 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime59,833+11
Previous prime59,809−13
Distance to nearest prime11
Nearest square below59,536
Nearest square above60,025

Powers & multiples

59,822 to the power 23,578,671,684
59,822 to the power 3214,083,297,480,248
59,822 to the power 412,806,891,021,863,395,856
59,822 to the power 5766,133,834,709,912,066,897,632
First ten multiples59,822, 119,644, 179,466, 239,288, 299,110, 358,932, 418,754, 478,576, 538,398, 598,220
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 173the total stopping time
Highest value reached201,9043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps59,822 → 29,911 → 89,734 → 44,867 → 134,602 → 67,301 → 201,904 → 100,952 → 50,476 → 25,238 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,982,200%
59,822% as a decimal598.22
59,822% of 10059,822
59,822% of 1,000598,220
As a fraction of 10059,822/100

Read another way

As bytes58.42 KiB
As a 24-bit colour#00E9AE

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