Recognised as Number

28,999

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value28,999

Digit count5

Digit sum37

Digit product11,664

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation47 × 617

Distinct prime factors247, 617

Number of divisors4

Sum of divisors σ(n)29,664

Aliquot sum665sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)14,168the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 28,336

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 47, 617, 28,9994 in total

Arithmetic

Previous number28,998

Next number29,000

Double57,998

Half14,499.5

Square840,942,001

Cube24,386,477,086,999

Square root170.290927533≈irrational, shown to 9 decimal places

Cube root30.722815113≈

Negation-28,999

Reciprocal0.0000344839≈

Representations

Decimal28,999

Binary11100010100011115 bits

Octal70507

Hexadecimal7147

Base 36MDJ

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

In wordstwenty-eight thousand, nine hundred and ninety-nine

Ordinaltwenty-eight thousand, nine hundred and ninety-ninth

Scientific notation2.8999 × 10^4

Engineering notation28.999 × 10^3

In other bases

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

Quinary1411444base 5; one hand: 7 digits

Septenary150355base 7: 6 digits

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

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

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

Sexagesimal8:3:19base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0111000101000111

Bit length15 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits7within that length

Bit parityeven8 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

Bytes271 47

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

At each machine width

16-bit0111000101000111

32-bit00000000000000000111000101000111

64-bit0000000000000000000000000000000000000000000000000111000101000111

One's complement1000111010111000at 16 bits, every bit flipped

Bits reversed1110001010001110at 16 bits

Rotated left by 11110001010001110at 16 bits, wrapping

Shifted left by 11110001010001110= 57,998, no wrap

Shifted right by 111100010100011= 14,499, discarding the low bit

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

Nearest landmarks

Next prime29,009+10

Previous prime28,979−20

Distance to nearest prime10

Nearest square below28,900

Nearest square above29,241

Powers & multiples

28,999 to the power 2840,942,001

28,999 to the power 324,386,477,086,999

28,999 to the power 4707,183,449,045,884,001

28,999 to the power 520,507,612,838,881,590,144,999

First ten multiples28,999, 57,998, 86,997, 115,996, 144,995, 173,994, 202,993, 231,992, 260,991, 289,990

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 7

Divisible by 9No, remainder 1

Divisible by 10No, remainder 9

Divisible by 11No, remainder 3

Divisible by 12No, remainder 7

Divisible by 100No, remainder 99

Collatz (3n + 1) trajectory

Steps to reach 1165the total stopping time

Highest value reached557,44019× the starting value

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

First steps28,999 → 86,998 → 43,499 → 130,498 → 65,249 → 195,748 → 97,874 → 48,937 → 146,812 → 73,406 → …

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

As a percentage & fraction

As a percentage2,899,900%

28,999% as a decimal289.99

28,999% of 10028,999

28,999% of 1,000289,990

As a fraction of 10028,999/100

Read another way

As seconds8 hours, 3 minutes and 19 seconds

As bytes28.319 KiB

As a 24-bit colour#007147

Keep nerding

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