Recognised as Number

40,925

Positive
Odd
Composite
5 digits

40,925 is an odd 5-digit integer and a composite number. It has 6 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value40,925

Digit count5

Digit sum20

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation5^2 × 1,637

Distinct prime factors25, 1,637

Number of divisors6

Sum of divisors σ(n)50,778

Aliquot sum9,853sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)32,720integers below n that share no factor with it

Carmichael function λ(n)8,180the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 32,720

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 5, 25, 1,637, 8,185, 40,9256 in total

Arithmetic

Previous number40,924

Next number40,926

Double81,850

Half20,462.5

Square1,674,855,625

Cube68,543,466,453,125

Square root202.299283241≈irrational, shown to 9 decimal places

Cube root34.461133855≈

Negation-40,925

Reciprocal0.0000244349≈

Representations

Decimal40,925

Binary100111111101110116 bits

Octal117735

Hexadecimal9FDD

Base 36VKT

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsforty thousand, nine hundred and twenty-five

Ordinalforty thousand, nine hundred and twenty-fifth

Scientific notation4.0925 × 10^4

Engineering notation40.925 × 10^3

In other bases

Ternary2002010202base 3; the most digit-efficient integer base after e: 10 digits

Quinary2302200base 5; one hand: 7 digits

Septenary230213base 7: 6 digits

Nonary62122base 9; each digit is two ternary digits: 5 digits

Duodecimal1b825base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal5265base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal11:22:5base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1T01T011T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11110000000101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1001111111011101

Bit length16 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits4within that length

Bit parityeven12 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

Bytes29f dd

Gray code1101000000110011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1001111111011101

32-bit00000000000000001001111111011101

64-bit0000000000000000000000000000000000000000000000001001111111011101

One's complement0110000000100010at 16 bits, every bit flipped

Bits reversed1011101111111001at 16 bits

Rotated left by 10011111110111011at 16 bits, wrapping

Shifted left by 110011111110111010= 81,850, no wrap

Shifted right by 1100111111101110= 20,462, discarding the low bit

These bits as a double2.02196366 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime40,927+2

Previous prime40,903−22

Distance to nearest prime2

Nearest square below40,804

Nearest square above41,209

Powers & multiples

40,925 to the power 21,674,855,625

40,925 to the power 368,543,466,453,125

40,925 to the power 42,805,141,364,594,140,625

40,925 to the power 5114,800,410,346,015,205,078,125

First ten multiples40,925, 81,850, 122,775, 163,700, 204,625, 245,550, 286,475, 327,400, 368,325, 409,250

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 5Yes

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 2

Divisible by 10No, remainder 5

Divisible by 11No, remainder 5

Divisible by 12No, remainder 5

Divisible by 100No, remainder 25

Collatz (3n + 1) trajectory

Steps to reach 162the total stopping time

Highest value reached122,7763× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps40,925 → 122,776 → 61,388 → 30,694 → 15,347 → 46,042 → 23,021 → 69,064 → 34,532 → 17,266 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,092,500%

40,925% as a decimal409.25

40,925% of 10040,925

40,925% of 1,000409,250

As a fraction of 10040,925/100

Read another way

As seconds11 hours, 22 minutes and 5 seconds

As bytes39.966 KiB

As a 24-bit colour#009FDD

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.