Recognised as Number

42,808

Positive
Even
Composite
5 digits

42,808 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value42,808

Digit count5

Digit sum22

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 × 5,351

Distinct prime factors22, 5,351

Number of divisors8

Sum of divisors σ(n)80,280

Aliquot sum37,472sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)5,350the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 21,400

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 5,351, 10,702, 21,404, 42,8088 in total

Arithmetic

Previous number42,807

Next number42,809

Double85,616

Half21,404

Square1,832,524,864

Cube78,446,724,378,112

Square root206.900942482≈irrational, shown to 9 decimal places

Cube root34.981759203≈

Negation-42,808

Reciprocal0.0000233601≈

Representations

Decimal42,808

Binary101001110011100016 bits

Octal123470

HexadecimalA738

Base 36X14

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

In wordsforty-two thousand, eight hundred and eight

Ordinalforty-two thousand, eight hundred and eighth

Scientific notation4.2808 × 10^4

Engineering notation42.808 × 10^3

In other bases

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

Quinary2332213base 5; one hand: 7 digits

Septenary235543base 7: 6 digits

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

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

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

Sexagesimal11:53:28base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1010011100111000

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 33 trailing zeros

Power of twoNo

Bytes2a7 38

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

At each machine width

16-bit1010011100111000

32-bit00000000000000001010011100111000

64-bit0000000000000000000000000000000000000000000000001010011100111000

One's complement0101100011000111at 16 bits, every bit flipped

Bits reversed0001110011100101at 16 bits

Rotated left by 10100111001110001at 16 bits, wrapping

Shifted left by 110100111001110000= 85,616, no wrap

Shifted right by 1101001110011100= 21,404, discarding the low bit

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

Nearest landmarks

Next prime42,821+13

Previous prime42,797−11

Distance to nearest prime11

Nearest square below42,436

Nearest square above42,849

Powers & multiples

42,808 to the power 21,832,524,864

42,808 to the power 378,446,724,378,112

42,808 to the power 43,358,147,377,178,218,496

42,808 to the power 5143,755,572,922,245,177,376,768

First ten multiples42,808, 85,616, 128,424, 171,232, 214,040, 256,848, 299,656, 342,464, 385,272, 428,080

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5No, remainder 3

Divisible by 6No, remainder 4

Divisible by 7No, remainder 3

Divisible by 8Yes

Divisible by 9No, remainder 4

Divisible by 10No, remainder 8

Divisible by 11No, remainder 7

Divisible by 12No, remainder 4

Divisible by 100No, remainder 8

Collatz (3n + 1) trajectory

Steps to reach 1194the total stopping time

Highest value reached146,5003× the starting value

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

First steps42,808 → 21,404 → 10,702 → 5,351 → 16,054 → 8,027 → 24,082 → 12,041 → 36,124 → 18,062 → …

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

As a percentage & fraction

As a percentage4,280,800%

42,808% as a decimal428.08

42,808% of 10042,808

42,808% of 1,000428,080

As a fraction of 10042,808/100

Read another way

As seconds11 hours, 53 minutes and 28 seconds

As bytes41.805 KiB

As a 24-bit colour#00A738

Keep nerding

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