Nerdulator> put something in

Recognised as Number

41,802

  • Positive
  • Even
  • Composite
  • 5 digits

41,802 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value41,802
Digit count5
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 6,967
Distinct prime factors32, 3, 6,967
Number of divisors8
Sum of divisors σ(n)83,616
Aliquot sum41,814sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)13,932integers below n that share no factor with it
Carmichael function λ(n)6,966the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 13,932
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 6,967, 13,934, 20,901, 41,8028 in total

Arithmetic

Previous number41,801
Next number41,803
Double83,604
Half20,901
Square root204.455374104≈irrational, shown to 9 decimal places
Cube root34.705557111≈
Negation-41,802
Reciprocal0.0000239223≈

Representations

Decimal41,802
Binary101000110100101016 bits
Octal121512
HexadecimalA34A
Base 36W96
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-one thousand, eight hundred and two
Ordinalforty-one thousand, eight hundred and second
Scientific notation4.1802 × 10^4
Engineering notation41.802 × 10^3

In other bases

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

Bit-level

1010001101001010
Bit length16 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits9within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes2a3 4a
Gray code1111001011101111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010001101001010
32-bit00000000000000001010001101001010
64-bit0000000000000000000000000000000000000000000000001010001101001010
One's complement0101110010110101at 16 bits, every bit flipped
Bits reversed0101001011000101at 16 bits
Rotated left by 10100011010010101at 16 bits, wrapping
Shifted left by 110100011010010100= 83,604, no wrap
Shifted right by 1101000110100101= 20,901, discarding the low bit
These bits as a double2.06529321 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime41,809+7
Previous prime41,801−1
Distance to nearest prime1
Nearest square below41,616
Nearest square above42,025

Powers & multiples

41,802 to the power 21,747,407,204
41,802 to the power 373,045,115,941,608
41,802 to the power 43,053,431,936,591,097,616
41,802 to the power 5127,639,561,813,381,062,544,032
First ten multiples41,802, 83,604, 125,406, 167,208, 209,010, 250,812, 292,614, 334,416, 376,218, 418,020
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 188the total stopping time
Highest value reached80,5121× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps41,802 → 20,901 → 62,704 → 31,352 → 15,676 → 7,838 → 3,919 → 11,758 → 5,879 → 17,638 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,180,200%
41,802% as a decimal418.02
41,802% of 10041,802
41,802% of 1,000418,020
As a fraction of 10041,802/100

Read another way

As bytes40.822 KiB
As a 24-bit colour#00A34A

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 “41802” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.