Recognised as Number

28,469

Positive
Odd
Composite
5 digits

28,469 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value28,469

Digit count5

Digit sum29

Digit product3,456

Multiplicative persistence3times the digit product can be taken before one digit is left

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7^3 × 83

Distinct prime factors27, 83

Number of divisors8

Sum of divisors σ(n)33,600

Aliquot sum5,131sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)12,054the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 24,108

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 7, 49, 83, 343, 581, 4,067, 28,4698 in total

Arithmetic

Previous number28,468

Next number28,470

Double56,938

Half14,234.5

Square810,483,961

Cube23,073,667,885,709

Square root168.727591105≈irrational, shown to 9 decimal places

Cube root30.5344947≈

Negation-28,469

Reciprocal0.0000351259≈

Representations

Decimal28,469

Binary11011110011010115 bits

Octal67465

Hexadecimal6F35

Base 36LYT

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

In wordstwenty-eight thousand, four hundred and sixty-nine

Ordinaltwenty-eight thousand, four hundred and sixty-ninth

Scientific notation2.8469 × 10^4

Engineering notation28.469 × 10^3

In other bases

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

Quinary1402334base 5; one hand: 7 digits

Septenary146000base 7: 6 digits

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

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

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

Sexagesimal7:54:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0110111100110101

Bit length15 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits5within that length

Bit parityeven10 set bits, so even; not the same as the number itself being odd

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes26f 35

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

At each machine width

16-bit0110111100110101

32-bit00000000000000000110111100110101

64-bit0000000000000000000000000000000000000000000000000110111100110101

One's complement1001000011001010at 16 bits, every bit flipped

Bits reversed1010110011110110at 16 bits

Rotated left by 11101111001101010at 16 bits, wrapping

Shifted left by 11101111001101010= 56,938, no wrap

Shifted right by 111011110011010= 14,234, discarding the low bit

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

Nearest landmarks

Next prime28,477+8

Previous prime28,463−6

Distance to nearest prime6

Nearest square below28,224

Nearest square above28,561

Powers & multiples

28,469 to the power 2810,483,961

28,469 to the power 323,073,667,885,709

28,469 to the power 4656,884,251,038,249,521

28,469 to the power 518,700,837,742,807,925,613,349

First ten multiples28,469, 56,938, 85,407, 113,876, 142,345, 170,814, 199,283, 227,752, 256,221, 284,690

Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

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 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 2

Divisible by 10No, remainder 9

Divisible by 11No, remainder 1

Divisible by 12No, remainder 5

Divisible by 100No, remainder 69

Collatz (3n + 1) trajectory

Steps to reach 1152the total stopping time

Highest value reached85,4083× the starting value

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

First steps28,469 → 85,408 → 42,704 → 21,352 → 10,676 → 5,338 → 2,669 → 8,008 → 4,004 → 2,002 → …

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

As a percentage & fraction

As a percentage2,846,900%

28,469% as a decimal284.69

28,469% of 10028,469

28,469% of 1,000284,690

As a fraction of 10028,469/100

Read another way

As seconds7 hours, 54 minutes and 29 seconds

As bytes27.802 KiB

As a 24-bit colour#006F35

Keep nerding

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