Nerdulator> put something in

Recognised as Number

12,242

  • Positive
  • Even
  • Composite
  • 5 digits

12,242 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 value12,242
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 × 6,121
Distinct prime factors22, 6,121
Number of divisors4
Sum of divisors σ(n)18,366
Aliquot sum6,124sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,120integers below n that share no factor with it
Carmichael function λ(n)6,120the 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, 6,121, 12,2424 in total

Arithmetic

Previous number12,241
Next number12,243
Double24,484
Half6,121
Square root110.643571887≈irrational, shown to 9 decimal places
Cube root23.047162206≈
Negation-12,242
Reciprocal0.000081686≈

Representations

Decimal12,242
Binary1011111101001014 bits
Octal27722
Hexadecimal2FD2
Base 369G2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwelve thousand, two hundred and forty-two
Ordinaltwelve thousand, two hundred and forty-second
Scientific notation1.2242 × 10^4
Engineering notation12.242 × 10^3

In other bases

Ternary121210102base 3; the most digit-efficient integer base after e: 9 digits
Quinary342432base 5; one hand: 6 digits
Septenary50456base 7: 5 digits
Nonary17712base 9; each digit is two ternary digits: 5 digits
Duodecimal7102base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1ac2base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:24:2base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T0TT1011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111000011010110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0010111111010010
Bit length14 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits5within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 13worth 8,192
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes22f d2
Gray code11100000111011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0010111111010010
32-bit00000000000000000010111111010010
64-bit0000000000000000000000000000000000000000000000000010111111010010
One's complement1101000000101101at 16 bits, every bit flipped
Bits reversed0100101111110100at 16 bits
Rotated left by 10101111110100100at 16 bits, wrapping
Shifted left by 1101111110100100= 24,484, no wrap
Shifted right by 11011111101001= 6,121, discarding the low bit
These bits as a double6.04835164 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime12,251+9
Previous prime12,241−1
Distance to nearest prime1
Nearest square below12,100
Nearest square above12,321

Powers & multiples

12,242 to the power 2149,866,564
12,242 to the power 31,834,666,476,488
12,242 to the power 422,459,987,005,166,096
12,242 to the power 5274,955,160,917,243,347,232
First ten multiples12,242, 24,484, 36,726, 48,968, 61,210, 73,452, 85,694, 97,936, 110,178, 122,420
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

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 2
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 10
Divisible by 12No, remainder 2
Divisible by 100No, remainder 42

Collatz (3n + 1) trajectory

Steps to reach 1174the total stopping time
Highest value reached8,153,620666× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps12,242 → 6,121 → 18,364 → 9,182 → 4,591 → 13,774 → 6,887 → 20,662 → 10,331 → 30,994 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,224,200%
12,242% as a decimal122.42
12,242% of 10012,242
12,242% of 1,000122,420
As a fraction of 10012,242/100

Read another way

As bytes11.955 KiB
As a 24-bit colour#002FD2

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