Recognised as Number

40,904

Positive
Even
Composite
5 digits

40,904 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value40,904

Digit count5

Digit sum17

Digit product0zero, because one of the digits is zero

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

Digital root8repeated digit sum

PalindromicYesreads the same backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 5,113

Distinct prime factors22, 5,113

Number of divisors8

Sum of divisors σ(n)76,710

Aliquot sum35,806sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)5,112the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 20,448

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 5,113, 10,226, 20,452, 40,9048 in total

Arithmetic

Previous number40,903

Next number40,905

Double81,808

Half20,452

Square1,673,137,216

Cube68,438,004,683,264

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

Cube root34.455238456≈

Negation-40,904

Reciprocal0.0000244475≈

Representations

Decimal40,904

Binary100111111100100016 bits

Octal117710

Hexadecimal9FC8

Base 36VK8

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

In wordsforty thousand, nine hundred and four

Ordinalforty thousand, nine hundred and fourth

Scientific notation4.0904 × 10^4

Engineering notation40.904 × 10^3

In other bases

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

Quinary2302104base 5; one hand: 7 digits

Septenary230153base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001111111001000

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

Bit parityodd9 set bits, so odd; not the same as the number itself being even

Highest set bitbit 15worth 32,768

Lowest set bitbit 33 trailing zeros

Power of twoNo

Bytes29f c8

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

At each machine width

16-bit1001111111001000

32-bit00000000000000001001111111001000

64-bit0000000000000000000000000000000000000000000000001001111111001000

One's complement0110000000110111at 16 bits, every bit flipped

Bits reversed0001001111111001at 16 bits

Rotated left by 10011111110010001at 16 bits, wrapping

Shifted left by 110011111110010000= 81,808, no wrap

Shifted right by 1100111111100100= 20,452, discarding the low bit

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

Nearest landmarks

Next prime40,927+23

Previous prime40,903−1

Distance to nearest prime1

Nearest square below40,804

Nearest square above41,209

Powers & multiples

40,904 to the power 21,673,137,216

40,904 to the power 368,438,004,683,264

40,904 to the power 42,799,388,143,564,230,656

40,904 to the power 5114,506,172,624,351,290,753,024

First ten multiples40,904, 81,808, 122,712, 163,616, 204,520, 245,424, 286,328, 327,232, 368,136, 409,040

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5No, remainder 4

Divisible by 6No, remainder 2

Divisible by 7No, remainder 3

Divisible by 8Yes

Divisible by 9No, remainder 8

Divisible by 10No, remainder 4

Divisible by 11No, remainder 6

Divisible by 12No, remainder 8

Divisible by 100No, remainder 4

Collatz (3n + 1) trajectory

Steps to reach 1137the total stopping time

Highest value reached40,904

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

First steps40,904 → 20,452 → 10,226 → 5,113 → 15,340 → 7,670 → 3,835 → 11,506 → 5,753 → 17,260 → …

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

As a percentage & fraction

As a percentage4,090,400%

40,904% as a decimal409.04

40,904% of 10040,904

40,904% of 1,000409,040

As a fraction of 10040,904/100

Read another way

As seconds11 hours, 21 minutes and 44 seconds

As bytes39.945 KiB

As a 24-bit colour#009FC8

Keep nerding

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