Nerdulator> put something in

Recognised as Number

52,168

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value52,168
Digit count5
Digit sum22
Digit product480
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 6,521
Distinct prime factors22, 6,521
Number of divisors8
Sum of divisors σ(n)97,830
Aliquot sum45,662sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)26,080integers below n that share no factor with it
Carmichael function λ(n)6,520the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 26,080
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 6,521, 13,042, 26,084, 52,1688 in total

Arithmetic

Previous number52,167
Next number52,169
Double104,336
Half26,084
Square root228.403152343≈irrational, shown to 9 decimal places
Cube root37.365264631≈
Negation-52,168
Reciprocal0.0000191688≈

Representations

Decimal52,168
Binary110010111100100016 bits
Octal145710
HexadecimalCBC8
Base 361494
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-two thousand, one hundred and sixty-eight
Ordinalfifty-two thousand, one hundred and sixty-eighth
Scientific notation5.2168 × 10^4
Engineering notation52.168 × 10^3

In other bases

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

Bit-level

1100101111001000
Bit length16 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits8within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes2cb c8
Gray code1010111000101100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1100101111001000
32-bit00000000000000001100101111001000
64-bit0000000000000000000000000000000000000000000000001100101111001000
One's complement0011010000110111at 16 bits, every bit flipped
Bits reversed0001001111010011at 16 bits
Rotated left by 11001011110010001at 16 bits, wrapping
Shifted left by 111001011110010000= 104,336, no wrap
Shifted right by 1110010111100100= 26,084, discarding the low bit
These bits as a double2.57744166 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime52,177+9
Previous prime52,163−5
Distance to nearest prime5
Nearest square below51,984
Nearest square above52,441

Powers & multiples

52,168 to the power 22,721,500,224
52,168 to the power 3141,975,223,685,632
52,168 to the power 47,406,563,469,232,050,176
52,168 to the power 5386,385,603,062,897,593,581,568
First ten multiples52,168, 104,336, 156,504, 208,672, 260,840, 313,008, 365,176, 417,344, 469,512, 521,680
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1184the total stopping time
Highest value reached225,9884× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps52,168 → 26,084 → 13,042 → 6,521 → 19,564 → 9,782 → 4,891 → 14,674 → 7,337 → 22,012 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,216,800%
52,168% as a decimal521.68
52,168% of 10052,168
52,168% of 1,000521,680
As a fraction of 10052,168/100

Read another way

As bytes50.945 KiB
As a 24-bit colour#00CBC8

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