Recognised as Number
28,690
- Positive
- Even
- Composite
- 5 digits
28,690 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value28,690
Digit count5
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 5 × 19 × 151
Distinct prime factors42, 5, 19, 151
Number of divisors16
Sum of divisors σ(n)54,720
Aliquot sum26,030sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)10,800integers below n that share no factor with it
Carmichael function λ(n)900the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 10,800
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 19, 38, 95, 151, 190, 302, 755, 1,510, 2,869, 5,738, 14,345, 28,69016 in total
Arithmetic
Representations
Decimal28,690
Binary11100000001001015 bits
Octal70022
Hexadecimal7012
Base 36M4Y
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwenty-eight thousand, six hundred and ninety
Ordinaltwenty-eight thousand, six hundred and ninetieth
Scientific notation2.869 × 10^4
Engineering notation28.69 × 10^3
In other bases
Ternary1110100121base 3; the most digit-efficient integer base after e: 10 digits
Quinary1404230base 5; one hand: 7 digits
Septenary146434base 7: 6 digits
Nonary43317base 9; each digit is two ternary digits: 5 digits
Duodecimal1472abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3beabase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:58:10base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1110101TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011000000010110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0111000000010010
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 11 trailing zero
Power of twoNo
Bytes270 12
Gray code100100000011011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit0111000000010010
32-bit00000000000000000111000000010010
64-bit0000000000000000000000000000000000000000000000000111000000010010
One's complement1000111111101101at 16 bits, every bit flipped
Bits reversed0100100000001110at 16 bits
Rotated left by 11110000000100100at 16 bits, wrapping
Shifted left by 11110000000100100= 57,380, no wrap
Shifted right by 111100000001001= 14,345, discarding the low bit
These bits as a double1.41747434 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
28,690 to the power 2823,116,100
28,690 to the power 323,615,200,909,000
28,690 to the power 4677,520,114,079,210,000
28,690 to the power 519,438,052,072,932,534,900,000
First ten multiples28,690, 57,380, 86,070, 114,760, 143,450, 172,140, 200,830, 229,520, 258,210, 286,900
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8No, remainder 2
Divisible by 9No, remainder 7
Divisible by 10Yes
Divisible by 11No, remainder 2
Divisible by 12No, remainder 10
Divisible by 100No, remainder 90
Collatz (3n + 1) trajectory
Steps to reach 1196the total stopping time
Highest value reached1,276,93644× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps28,690 → 14,345 → 43,036 → 21,518 → 10,759 → 32,278 → 16,139 → 48,418 → 24,209 → 72,628 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage2,869,000%
28,690% as a decimal286.9
28,690% of 10028,690
28,690% of 1,000286,900
As a fraction of 10028,690/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 28,690
Nerdulate something else
Nothing in mind? Surprise me · today’s page