Recognised as Number

52,599

Positive
Odd
Composite
5 digits

52,599 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value52,599

Digit count5

Digit sum30

Digit product4,050

Multiplicative persistence2times 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 factorisation3 × 89 × 197

Distinct prime factors33, 89, 197

Number of divisors8

Sum of divisors σ(n)71,280

Aliquot sum18,681sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)34,496integers below n that share no factor with it

Carmichael function λ(n)4,312the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 34,496

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 89, 197, 267, 591, 17,533, 52,5998 in total

Arithmetic

Previous number52,598

Next number52,600

Double105,198

Half26,299.5

Square2,766,654,801

Cube145,523,275,877,799

Square root229.34471871≈irrational, shown to 9 decimal places

Cube root37.467883613≈

Negation-52,599

Reciprocal0.0000190118≈

Representations

Decimal52,599

Binary110011010111011116 bits

Octal146567

HexadecimalCD77

Base 3614L3

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsfifty-two thousand, five hundred and ninety-nine

Ordinalfifty-two thousand, five hundred and ninety-ninth

Scientific notation5.2599 × 10^4

Engineering notation52.599 × 10^3

In other bases

Ternary2200011010base 3; the most digit-efficient integer base after e: 10 digits

Quinary3140344base 5; one hand: 7 digits

Septenary306231base 7: 6 digits

Nonary80133base 9; each digit is two ternary digits: 5 digits

Duodecimal26533base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal6b9jbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal14:36:39base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary10T00011010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11101001010001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1100110101110111

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

Bytes2cd 77

Gray code1010101111001100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1100110101110111

32-bit00000000000000001100110101110111

64-bit0000000000000000000000000000000000000000000000001100110101110111

One's complement0011001010001000at 16 bits, every bit flipped

Bits reversed1110111010110011at 16 bits

Rotated left by 11001101011101111at 16 bits, wrapping

Shifted left by 111001101011101110= 105,198, no wrap

Shifted right by 1110011010111011= 26,299, discarding the low bit

These bits as a double2.59873589 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime52,609+10

Previous prime52,583−16

Distance to nearest prime10

Nearest square below52,441

Nearest square above52,900

Powers & multiples

52,599 to the power 22,766,654,801

52,599 to the power 3145,523,275,877,799

52,599 to the power 47,654,378,787,896,349,601

52,599 to the power 5402,612,669,864,560,092,662,999

First ten multiples52,599, 105,198, 157,797, 210,396, 262,995, 315,594, 368,193, 420,792, 473,391, 525,990

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 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 1

Divisible by 8No, remainder 7

Divisible by 9No, remainder 3

Divisible by 10No, remainder 9

Divisible by 11No, remainder 8

Divisible by 12No, remainder 3

Divisible by 100No, remainder 99

Collatz (3n + 1) trajectory

Steps to reach 165the total stopping time

Highest value reached355,0486× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps52,599 → 157,798 → 78,899 → 236,698 → 118,349 → 355,048 → 177,524 → 88,762 → 44,381 → 133,144 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,259,900%

52,599% as a decimal525.99

52,599% of 10052,599

52,599% of 1,000525,990

As a fraction of 10052,599/100

Read another way

As seconds14 hours, 36 minutes and 39 seconds

As bytes51.366 KiB

As a 24-bit colour#00CD77

Keep nerding

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