Nerdulator> put something in

Recognised as Number

41,807

  • Positive
  • Odd
  • Composite
  • 5 digits

41,807 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value41,807
Digit count5
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation97 × 431
Distinct prime factors297, 431
Number of divisors4
Sum of divisors σ(n)42,336
Aliquot sum529sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)41,280integers below n that share no factor with it
Carmichael function λ(n)20,640the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 41,280
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 97, 431, 41,8074 in total

Arithmetic

Previous number41,806
Next number41,808
Double83,614
Square root204.467601346≈irrational, shown to 9 decimal places
Cube root34.706940784≈
Negation-41,807
Reciprocal0.0000239194≈

Representations

Decimal41,807
Binary101000110100111116 bits
Octal121517
HexadecimalA34F
Base 36W9B
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-one thousand, eight hundred and seven
Ordinalforty-one thousand, eight hundred and seventh
Scientific notation4.1807 × 10^4
Engineering notation41.807 × 10^3

In other bases

Ternary2010100102base 3; the most digit-efficient integer base after e: 10 digits
Quinary2314212base 5; one hand: 7 digits
Septenary232613base 7: 6 digits
Nonary63312base 9; each digit is two ternary digits: 5 digits
Duodecimal2023bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal54a7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal11:36:47base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T01010011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110011101010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1010001101001111
Bit length16 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits7within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2a3 4f
Gray code1111001011101000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010001101001111
32-bit00000000000000001010001101001111
64-bit0000000000000000000000000000000000000000000000001010001101001111
One's complement0101110010110000at 16 bits, every bit flipped
Bits reversed1111001011000101at 16 bits
Rotated left by 10100011010011111at 16 bits, wrapping
Shifted left by 110100011010011110= 83,614, no wrap
Shifted right by 1101000110100111= 20,903, discarding the low bit
These bits as a double2.06554025 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime41,809+2
Previous prime41,801−6
Distance to nearest prime2
Nearest square below41,616
Nearest square above42,025

Powers & multiples

41,807 to the power 21,747,825,249
41,807 to the power 373,071,330,184,943
41,807 to the power 43,054,893,101,041,912,001
41,807 to the power 5127,715,915,875,259,215,025,807
First ten multiples41,807, 83,614, 125,421, 167,228, 209,035, 250,842, 292,649, 334,456, 376,263, 418,070
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 7

Collatz (3n + 1) trajectory

Steps to reach 1150the total stopping time
Highest value reached423,30410× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps41,807 → 125,422 → 62,711 → 188,134 → 94,067 → 282,202 → 141,101 → 423,304 → 211,652 → 105,826 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,180,700%
41,807% as a decimal418.07
41,807% of 10041,807
41,807% of 1,000418,070
As a fraction of 10041,807/100

Read another way

As bytes40.827 KiB
As a 24-bit colour#00A34F

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “41807” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.