Recognised as Number

42,807

Positive
Odd
Composite
5 digits

42,807 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value42,807

Digit count5

Digit sum21

Digit product0zero, because one of the digits is zero

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 19 × 751

Distinct prime factors33, 19, 751

Number of divisors8

Sum of divisors σ(n)60,160

Aliquot sum17,353sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,250the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 27,000

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 19, 57, 751, 2,253, 14,269, 42,8078 in total

Arithmetic

Previous number42,806

Next number42,808

Double85,614

Half21,403.5

Square1,832,439,249

Cube78,441,226,931,943

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

Cube root34.981486808≈

Negation-42,807

Reciprocal0.0000233607≈

Representations

Decimal42,807

Binary101001110011011116 bits

Octal123467

HexadecimalA737

Base 36X13

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

In wordsforty-two thousand, eight hundred and seven

Ordinalforty-two thousand, eight hundred and seventh

Scientific notation4.2807 × 10^4

Engineering notation42.807 × 10^3

In other bases

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

Quinary2332212base 5; one hand: 7 digits

Septenary235542base 7: 6 digits

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

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

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

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

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

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

Bit-level

1010011100110111

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2a7 37

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

At each machine width

16-bit1010011100110111

32-bit00000000000000001010011100110111

64-bit0000000000000000000000000000000000000000000000001010011100110111

One's complement0101100011001000at 16 bits, every bit flipped

Bits reversed1110110011100101at 16 bits

Rotated left by 10100111001101111at 16 bits, wrapping

Shifted left by 110100111001101110= 85,614, no wrap

Shifted right by 1101001110011011= 21,403, discarding the low bit

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

Nearest landmarks

Next prime42,821+14

Previous prime42,797−10

Distance to nearest prime10

Nearest square below42,436

Nearest square above42,849

Powers & multiples

42,807 to the power 21,832,439,249

42,807 to the power 378,441,226,931,943

42,807 to the power 43,357,833,601,275,684,001

42,807 to the power 5143,738,782,969,808,205,030,807

First ten multiples42,807, 85,614, 128,421, 171,228, 214,035, 256,842, 299,649, 342,456, 385,263, 428,070

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 7

Divisible by 9No, remainder 3

Divisible by 10No, remainder 7

Divisible by 11No, remainder 6

Divisible by 12No, remainder 3

Divisible by 100No, remainder 7

Collatz (3n + 1) trajectory

Steps to reach 1194the total stopping time

Highest value reached288,9526× the starting value

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

First steps42,807 → 128,422 → 64,211 → 192,634 → 96,317 → 288,952 → 144,476 → 72,238 → 36,119 → 108,358 → …

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

As a percentage & fraction

As a percentage4,280,700%

42,807% as a decimal428.07

42,807% of 10042,807

42,807% of 1,000428,070

As a fraction of 10042,807/100

Read another way

As seconds11 hours, 53 minutes and 27 seconds

As bytes41.804 KiB

As a 24-bit colour#00A737

Keep nerding

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