Nerdulator> put something in

Recognised as Number

52,167

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value52,167
Digit count5
Digit sum21
Digit product420
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 × 17,389
Distinct prime factors23, 17,389
Number of divisors4
Sum of divisors σ(n)69,560
Aliquot sum17,393sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)34,776integers below n that share no factor with it
Carmichael function λ(n)17,388the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 34,776
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 17,389, 52,1674 in total

Arithmetic

Previous number52,166
Next number52,168
Double104,334
Square root228.40096322≈irrational, shown to 9 decimal places
Cube root37.36502588≈
Negation-52,167
Reciprocal0.0000191692≈

Representations

Decimal52,167
Binary110010111100011116 bits
Octal145707
HexadecimalCBC7
Base 361493
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-two thousand, one hundred and sixty-seven
Ordinalfifty-two thousand, one hundred and sixty-seventh
Scientific notation5.2167 × 10^4
Engineering notation52.167 × 10^3

In other bases

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

Bit-level

1100101111000111
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 odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2cb c7
Gray code1010111000100100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1100101111000111
32-bit00000000000000001100101111000111
64-bit0000000000000000000000000000000000000000000000001100101111000111
One's complement0011010000111000at 16 bits, every bit flipped
Bits reversed1110001111010011at 16 bits
Rotated left by 11001011110001111at 16 bits, wrapping
Shifted left by 111001011110001110= 104,334, no wrap
Shifted right by 1110010111100011= 26,083, discarding the low bit
These bits as a double2.57739225 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime52,177+10
Previous prime52,163−4
Distance to nearest prime4
Nearest square below51,984
Nearest square above52,441

Powers & multiples

52,167 to the power 22,721,395,889
52,167 to the power 3141,967,059,341,463
52,167 to the power 47,405,995,584,666,100,321
52,167 to the power 5386,348,571,665,276,455,445,607
First ten multiples52,167, 104,334, 156,501, 208,668, 260,835, 313,002, 365,169, 417,336, 469,503, 521,670
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 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 3
Divisible by 100No, remainder 67

Collatz (3n + 1) trajectory

Steps to reach 183the total stopping time
Highest value reached564,06410× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps52,167 → 156,502 → 78,251 → 234,754 → 117,377 → 352,132 → 176,066 → 88,033 → 264,100 → 132,050 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,216,700%
52,167% as a decimal521.67
52,167% of 10052,167
52,167% of 1,000521,670
As a fraction of 10052,167/100

Read another way

As bytes50.944 KiB
As a 24-bit colour#00CBC7

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