Nerdulator> put something in

Recognised as Number

41,247

  • Positive
  • Odd
  • Composite
  • 5 digits

41,247 is an odd 5-digit integer and a composite number. It has 6 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value41,247
Digit count5
Digit sum18
Digit product224
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 4,583
Distinct prime factors23, 4,583
Number of divisors6
Sum of divisors σ(n)59,592
Aliquot sum18,345sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)27,492integers below n that share no factor with it
Carmichael function λ(n)13,746the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 27,492
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 4,583, 13,749, 41,2476 in total

Arithmetic

Previous number41,246
Next number41,248
Double82,494
Square root203.093574492≈irrational, shown to 9 decimal places
Cube root34.551278503≈
Negation-41,247
Reciprocal0.0000242442≈

Representations

Decimal41,247
Binary101000010001111116 bits
Octal120437
HexadecimalA11F
Base 36VTR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-one thousand, two hundred and forty-seven
Ordinalforty-one thousand, two hundred and forty-seventh
Scientific notation4.1247 × 10^4
Engineering notation41.247 × 10^3

In other bases

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

Bit-level

1010000100011111
Bit length16 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits8within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2a1 1f
Gray code1111000110010000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010000100011111
32-bit00000000000000001010000100011111
64-bit0000000000000000000000000000000000000000000000001010000100011111
One's complement0101111011100000at 16 bits, every bit flipped
Bits reversed1111100010000101at 16 bits
Rotated left by 10100001000111111at 16 bits, wrapping
Shifted left by 110100001000111110= 82,494, no wrap
Shifted right by 1101000010001111= 20,623, discarding the low bit
These bits as a double2.03787257 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime41,257+10
Previous prime41,243−4
Distance to nearest prime4
Nearest square below41,209
Nearest square above41,616

Powers & multiples

41,247 to the power 21,701,315,009
41,247 to the power 370,174,140,176,223
41,247 to the power 42,894,472,759,848,670,081
41,247 to the power 5119,388,317,925,478,094,831,007
First ten multiples41,247, 82,494, 123,741, 164,988, 206,235, 247,482, 288,729, 329,976, 371,223, 412,470
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1150the total stopping time
Highest value reached626,45215× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps41,247 → 123,742 → 61,871 → 185,614 → 92,807 → 278,422 → 139,211 → 417,634 → 208,817 → 626,452 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,124,700%
41,247% as a decimal412.47
41,247% of 10041,247
41,247% of 1,000412,470
As a fraction of 10041,247/100

Read another way

As bytes40.28 KiB
As a 24-bit colour#00A11F

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