Nerdulator> put something in

Recognised as Number

41,222

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value41,222
Digit count5
Digit sum11
Digit product32
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 20,611
Distinct prime factors22, 20,611
Number of divisors4
Sum of divisors σ(n)61,836
Aliquot sum20,614sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)20,610integers below n that share no factor with it
Carmichael function λ(n)20,610the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 20,611, 41,2224 in total

Arithmetic

Previous number41,221
Next number41,223
Double82,444
Half20,611
Square root203.03201718≈irrational, shown to 9 decimal places
Cube root34.544296528≈
Negation-41,222
Reciprocal0.0000242589≈

Representations

Decimal41,222
Binary101000010000011016 bits
Octal120406
HexadecimalA106
Base 36VT2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-one thousand, two hundred and twenty-two
Ordinalforty-one thousand, two hundred and twenty-second
Scientific notation4.1222 × 10^4
Engineering notation41.222 × 10^3

In other bases

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

Bit-level

1010000100000110
Bit length16 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits11within that length
Bit parityodd5 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
Bytes2a1 06
Gray code1111000110000101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010000100000110
32-bit00000000000000001010000100000110
64-bit0000000000000000000000000000000000000000000000001010000100000110
One's complement0101111011111001at 16 bits, every bit flipped
Bits reversed0110000010000101at 16 bits
Rotated left by 10100001000001101at 16 bits, wrapping
Shifted left by 110100001000001100= 82,444, no wrap
Shifted right by 1101000010000011= 20,611, discarding the low bit
These bits as a double2.03663741 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime41,227+5
Previous prime41,221−1
Distance to nearest prime1
Nearest square below41,209
Nearest square above41,616

Powers & multiples

41,222 to the power 21,699,253,284
41,222 to the power 370,046,618,873,048
41,222 to the power 42,887,461,723,184,784,656
41,222 to the power 5119,026,947,153,123,193,089,632
First ten multiples41,222, 82,444, 123,666, 164,888, 206,110, 247,332, 288,554, 329,776, 370,998, 412,220
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1150the total stopping time
Highest value reached92,7522× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps41,222 → 20,611 → 61,834 → 30,917 → 92,752 → 46,376 → 23,188 → 11,594 → 5,797 → 17,392 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,122,200%
41,222% as a decimal412.22
41,222% of 10041,222
41,222% of 1,000412,220
As a fraction of 10041,222/100

Read another way

As bytes40.256 KiB
As a 24-bit colour#00A106

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