Nerdulator> put something in

Recognised as Number

52,169

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value52,169
Digit count5
Digit sum23
Digit product540
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation13 × 4,013
Distinct prime factors213, 4,013
Number of divisors4
Sum of divisors σ(n)56,196
Aliquot sum4,027sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)48,144integers below n that share no factor with it
Carmichael function λ(n)12,036the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 48,144
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 4,013, 52,1694 in total

Arithmetic

Previous number52,168
Next number52,170
Double104,338
Square root228.405341444≈irrational, shown to 9 decimal places
Cube root37.365503379≈
Negation-52,169
Reciprocal0.0000191685≈

Representations

Decimal52,169
Binary110010111100100116 bits
Octal145711
HexadecimalCBC9
Base 361495
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-two thousand, one hundred and sixty-nine
Ordinalfifty-two thousand, one hundred and sixty-ninth
Scientific notation5.2169 × 10^4
Engineering notation52.169 × 10^3

In other bases

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

Bit-level

1100101111001001
Bit length16 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits7within that length
Bit parityodd9 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
Bytes2cb c9
Gray code1010111000101101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1100101111001001
32-bit00000000000000001100101111001001
64-bit0000000000000000000000000000000000000000000000001100101111001001
One's complement0011010000110110at 16 bits, every bit flipped
Bits reversed1001001111010011at 16 bits
Rotated left by 11001011110010011at 16 bits, wrapping
Shifted left by 111001011110010010= 104,338, no wrap
Shifted right by 1110010111100100= 26,084, discarding the low bit
These bits as a double2.57749107 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime52,177+8
Previous prime52,163−6
Distance to nearest prime6
Nearest square below51,984
Nearest square above52,441

Powers & multiples

52,169 to the power 22,721,604,561
52,169 to the power 3141,983,388,342,809
52,169 to the power 47,407,131,386,456,002,721
52,169 to the power 5386,422,637,300,023,205,951,849
First ten multiples52,169, 104,338, 156,507, 208,676, 260,845, 313,014, 365,183, 417,352, 469,521, 521,690
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

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 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 69

Collatz (3n + 1) trajectory

Steps to reach 183the total stopping time
Highest value reached264,1125× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps52,169 → 156,508 → 78,254 → 39,127 → 117,382 → 58,691 → 176,074 → 88,037 → 264,112 → 132,056 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,216,900%
52,169% as a decimal521.69
52,169% of 10052,169
52,169% of 1,000521,690
As a fraction of 10052,169/100

Read another way

As bytes50.946 KiB
As a 24-bit colour#00CBC9

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