Nerdulator> put something in

Recognised as Number

41,457

  • Positive
  • Odd
  • Composite
  • 5 digits

41,457 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value41,457
Digit count5
Digit sum21
Digit product560
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 13 × 1,063
Distinct prime factors33, 13, 1,063
Number of divisors8
Sum of divisors σ(n)59,584
Aliquot sum18,127sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)25,488integers below n that share no factor with it
Carmichael function λ(n)2,124the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 25,488
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 13, 39, 1,063, 3,189, 13,819, 41,4578 in total

Arithmetic

Previous number41,456
Next number41,458
Double82,914
Square root203.609921173≈irrational, shown to 9 decimal places
Cube root34.609816008≈
Negation-41,457
Reciprocal0.0000241214≈

Representations

Decimal41,457
Binary101000011111000116 bits
Octal120761
HexadecimalA1F1
Base 36VZL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-one thousand, four hundred and fifty-seven
Ordinalforty-one thousand, four hundred and fifty-seventh
Scientific notation4.1457 × 10^4
Engineering notation41.457 × 10^3

In other bases

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

Bit-level

1010000111110001
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 f1
Gray code1111000100001001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010000111110001
32-bit00000000000000001010000111110001
64-bit0000000000000000000000000000000000000000000000001010000111110001
One's complement0101111000001110at 16 bits, every bit flipped
Bits reversed1000111110000101at 16 bits
Rotated left by 10100001111100011at 16 bits, wrapping
Shifted left by 110100001111100010= 82,914, no wrap
Shifted right by 1101000011111000= 20,728, discarding the low bit
These bits as a double2.04824795 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

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

Powers & multiples

41,457 to the power 21,718,682,849
41,457 to the power 371,251,434,870,993
41,457 to the power 42,953,870,735,446,756,801
41,457 to the power 5122,458,619,079,416,196,699,057
First ten multiples41,457, 82,914, 124,371, 165,828, 207,285, 248,742, 290,199, 331,656, 373,113, 414,570
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 57

Collatz (3n + 1) trajectory

Steps to reach 144the total stopping time
Highest value reached124,3723× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps41,457 → 124,372 → 62,186 → 31,093 → 93,280 → 46,640 → 23,320 → 11,660 → 5,830 → 2,915 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,145,700%
41,457% as a decimal414.57
41,457% of 10041,457
41,457% of 1,000414,570
As a fraction of 10041,457/100

Read another way

As bytes40.485 KiB
As a 24-bit colour#00A1F1

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