Nerdulator> put something in

Recognised as Number

41,801

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

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

Factors & divisors

Prime factorisation41,801
Distinct prime factors141,801
Number of divisors2
Sum of divisors σ(n)41,802
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)41,800integers below n that share no factor with it
Carmichael function λ(n)41,800the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 41,8012 in total

Arithmetic

Previous number41,800
Next number41,802
Double83,602
Square root204.452928568≈irrational, shown to 9 decimal places
Cube root34.705280363≈
Negation-41,801
Reciprocal0.0000239229≈

Representations

Decimal41,801
Binary101000110100100116 bits
Octal121511
HexadecimalA349
Base 36W95
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-one thousand, eight hundred and one
Ordinalforty-one thousand, eight hundred and first
Scientific notation4.1801 × 10^4
Engineering notation41.801 × 10^3

In other bases

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

Bit-level

1010001101001001
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 odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2a3 49
Gray code1111001011101101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010001101001001
32-bit00000000000000001010001101001001
64-bit0000000000000000000000000000000000000000000000001010001101001001
One's complement0101110010110110at 16 bits, every bit flipped
Bits reversed1001001011000101at 16 bits
Rotated left by 10100011010010011at 16 bits, wrapping
Shifted left by 110100011010010010= 83,602, no wrap
Shifted right by 1101000110100100= 20,900, discarding the low bit
These bits as a double2.06524381 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime41,809+8
Previous prime41,777−24
Distance to nearest prime0, it is prime
Nearest square below41,616
Nearest square above42,025

Powers & multiples

41,801 to the power 21,747,323,601
41,801 to the power 373,039,873,845,401
41,801 to the power 43,053,139,766,611,607,201
41,801 to the power 5127,624,295,384,131,792,609,001
First ten multiples41,801, 83,602, 125,403, 167,204, 209,005, 250,806, 292,607, 334,408, 376,209, 418,010
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1106the total stopping time
Highest value reached211,6245× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps41,801 → 125,404 → 62,702 → 31,351 → 94,054 → 47,027 → 141,082 → 70,541 → 211,624 → 105,812 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,180,100%
41,801% as a decimal418.01
41,801% of 10041,801
41,801% of 1,000418,010
As a fraction of 10041,801/100

Read another way

As bytes40.821 KiB
As a 24-bit colour#00A349

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