Nerdulator> put something in

Recognised as Number

28,696

  • Positive
  • Even
  • Composite
  • 5 digits

28,696 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value28,696
Digit count5
Digit sum31
Digit product5,184
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 17 × 211
Distinct prime factors32, 17, 211
Number of divisors16
Sum of divisors σ(n)57,240
Aliquot sum28,544sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)13,440integers below n that share no factor with it
Carmichael function λ(n)1,680the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 13,440
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 17, 34, 68, 136, 211, 422, 844, 1,688, 3,587, 7,174, 14,348, 28,69616 in total

Arithmetic

Previous number28,695
Next number28,697
Double57,392
Half14,348
Square root169.398937423≈irrational, shown to 9 decimal places
Cube root30.615436414≈
Negation-28,696
Reciprocal0.0000348481≈

Representations

Decimal28,696
Binary11100000001100015 bits
Octal70030
Hexadecimal7018
Base 36M54
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-eight thousand, six hundred and ninety-six
Ordinaltwenty-eight thousand, six hundred and ninety-sixth
Scientific notation2.8696 × 10^4
Engineering notation28.696 × 10^3

In other bases

Ternary1110100211base 3; the most digit-efficient integer base after e: 10 digits
Quinary1404241base 5; one hand: 7 digits
Septenary146443base 7: 6 digits
Nonary43324base 9; each digit is two ternary digits: 5 digits
Duodecimal14734base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3begbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:58:16base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1110101T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011000001101000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0111000000011000
Bit length15 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits10within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being even
Highest set bitbit 14worth 16,384
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes270 18
Gray code100100000010100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0111000000011000
32-bit00000000000000000111000000011000
64-bit0000000000000000000000000000000000000000000000000111000000011000
One's complement1000111111100111at 16 bits, every bit flipped
Bits reversed0001100000001110at 16 bits
Rotated left by 11110000000110000at 16 bits, wrapping
Shifted left by 11110000000110000= 57,392, no wrap
Shifted right by 111100000001100= 14,348, discarding the low bit
These bits as a double1.41777078 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime28,697+1
Previous prime28,687−9
Distance to nearest prime1
Nearest square below28,561
Nearest square above28,900

Powers & multiples

28,696 to the power 2823,460,416
28,696 to the power 323,630,020,097,536
28,696 to the power 4678,087,056,718,893,056
28,696 to the power 519,458,386,179,605,355,134,976
First ten multiples28,696, 57,392, 86,088, 114,784, 143,480, 172,176, 200,872, 229,568, 258,264, 286,960
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1121the total stopping time
Highest value reached28,696
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps28,696 → 14,348 → 7,174 → 3,587 → 10,762 → 5,381 → 16,144 → 8,072 → 4,036 → 2,018 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage2,869,600%
28,696% as a decimal286.96
28,696% of 10028,696
28,696% of 1,000286,960
As a fraction of 10028,696/100

Read another way

As bytes28.023 KiB
As a 24-bit colour#007018

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