Recognised as Number

40,927

Positive
Odd
Prime
5 digits

40,927 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value40,927

Digit count5

Digit sum22

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation40,927

Distinct prime factors140,927

Number of divisors2

Sum of divisors σ(n)40,928

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)40,926the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 40,9272 in total

Arithmetic

Previous number40,926

Next number40,928

Double81,854

Half20,463.5

Square1,675,019,329

Cube68,553,516,077,983

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

Cube root34.461695217≈

Negation-40,927

Reciprocal0.0000244337≈

Representations

Decimal40,927

Binary100111111101111116 bits

Octal117737

Hexadecimal9FDF

Base 36VKV

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

In wordsforty thousand, nine hundred and twenty-seven

Ordinalforty thousand, nine hundred and twenty-seventh

Scientific notation4.0927 × 10^4

Engineering notation40.927 × 10^3

In other bases

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

Quinary2302202base 5; one hand: 7 digits

Septenary230215base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001111111011111

Bit length16 bitsto write the magnitude

Set bits13the population count, or Hamming weight

Zero bits3within that length

Bit parityodd13 set bits, so odd; 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 df

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

At each machine width

16-bit1001111111011111

32-bit00000000000000001001111111011111

64-bit0000000000000000000000000000000000000000000000001001111111011111

One's complement0110000000100000at 16 bits, every bit flipped

Bits reversed1111101111111001at 16 bits

Rotated left by 10011111110111111at 16 bits, wrapping

Shifted left by 110011111110111110= 81,854, no wrap

Shifted right by 1100111111101111= 20,463, discarding the low bit

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

Nearest landmarks

Next prime40,933+6

Previous prime40,903−24

Distance to nearest prime0, it is prime

Nearest square below40,804

Nearest square above41,209

Powers & multiples

40,927 to the power 21,675,019,329

40,927 to the power 368,553,516,077,983

40,927 to the power 42,805,689,752,523,610,241

40,927 to the power 5114,828,464,501,533,796,333,407

First ten multiples40,927, 81,854, 122,781, 163,708, 204,635, 245,562, 286,489, 327,416, 368,343, 409,270

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 7

Divisible by 11No, remainder 7

Divisible by 12No, remainder 7

Divisible by 100No, remainder 27

Collatz (3n + 1) trajectory

Steps to reach 1137the total stopping time

Highest value reached621,59215× the starting value

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

First steps40,927 → 122,782 → 61,391 → 184,174 → 92,087 → 276,262 → 138,131 → 414,394 → 207,197 → 621,592 → …

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

As a percentage & fraction

As a percentage4,092,700%

40,927% as a decimal409.27

40,927% of 10040,927

40,927% of 1,000409,270

As a fraction of 10040,927/100

Read another way

As seconds11 hours, 22 minutes and 7 seconds

As bytes39.968 KiB

As a 24-bit colour#009FDF

Keep nerding

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