Nerdulator> put something in

Recognised as Number

59,823

  • Positive
  • Odd
  • Composite
  • 5 digits

59,823 is an odd 5-digit integer and a composite number. It has 18 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value59,823
Digit count5
Digit sum27
Digit product2,160
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 17^2 × 23
Distinct prime factors33, 17, 23
Number of divisors18
Sum of divisors σ(n)95,784
Aliquot sum35,961sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)35,904integers below n that share no factor with it
Carmichael function λ(n)8,976the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 35,904
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 17, 23, 51, 69, 153, 207, 289, 391, 867, 1,173, 2,601, 3,519, 6,647, 19,941, 59,82318 in total

Arithmetic

Previous number59,822
Next number59,824
Double119,646
Square root244.587407689≈irrational, shown to 9 decimal places
Cube root39.110142296≈
Negation-59,823
Reciprocal0.000016716≈

Representations

Decimal59,823
Binary111010011010111116 bits
Octal164657
HexadecimalE9AF
Base 361A5R
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-nine thousand, eight hundred and twenty-three
Ordinalfifty-nine thousand, eight hundred and twenty-third
Scientific notation5.9823 × 10^4
Engineering notation59.823 × 10^3

In other bases

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

Bit-level

1110100110101111
Bit length16 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits5within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2e9 af
Gray code1001110101111000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1110100110101111
32-bit00000000000000001110100110101111
64-bit0000000000000000000000000000000000000000000000001110100110101111
One's complement0001011001010000at 16 bits, every bit flipped
Bits reversed1111010110010111at 16 bits
Rotated left by 11101001101011111at 16 bits, wrapping
Shifted left by 111101001101011110= 119,646, no wrap
Shifted right by 1111010011010111= 29,911, discarding the low bit
These bits as a double2.95564891 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime59,833+10
Previous prime59,809−14
Distance to nearest prime10
Nearest square below59,536
Nearest square above60,025

Powers & multiples

59,823 to the power 23,578,791,329
59,823 to the power 3214,094,033,674,767
59,823 to the power 412,807,747,376,525,586,241
59,823 to the power 5766,197,871,305,890,145,695,343
First ten multiples59,823, 119,646, 179,469, 239,292, 299,115, 358,938, 418,761, 478,584, 538,407, 598,230
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1117the total stopping time
Highest value reached605,71610× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps59,823 → 179,470 → 89,735 → 269,206 → 134,603 → 403,810 → 201,905 → 605,716 → 302,858 → 151,429 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,982,300%
59,823% as a decimal598.23
59,823% of 10059,823
59,823% of 1,000598,230
As a fraction of 10059,823/100

Read another way

As bytes58.421 KiB
As a 24-bit colour#00E9AF

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