Recognised as Number

40,906

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value40,906

Digit count5

Digit sum19

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 113 × 181

Distinct prime factors32, 113, 181

Number of divisors8

Sum of divisors σ(n)62,244

Aliquot sum21,338sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 113, 181, 226, 362, 20,453, 40,9068 in total

Arithmetic

Previous number40,905

Next number40,907

Double81,812

Half20,453

Square1,673,300,836

Cube68,448,043,997,416

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

Cube root34.45580001≈

Negation-40,906

Reciprocal0.0000244463≈

Representations

Decimal40,906

Binary100111111100101016 bits

Octal117712

Hexadecimal9FCA

Base 36VKA

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

In wordsforty thousand, nine hundred and six

Ordinalforty thousand, nine hundred and sixth

Scientific notation4.0906 × 10^4

Engineering notation40.906 × 10^3

In other bases

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

Quinary2302111base 5; one hand: 7 digits

Septenary230155base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001111111001010

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes29f ca

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

At each machine width

16-bit1001111111001010

32-bit00000000000000001001111111001010

64-bit0000000000000000000000000000000000000000000000001001111111001010

One's complement0110000000110101at 16 bits, every bit flipped

Bits reversed0101001111111001at 16 bits

Rotated left by 10011111110010101at 16 bits, wrapping

Shifted left by 110011111110010100= 81,812, no wrap

Shifted right by 1100111111100101= 20,453, discarding the low bit

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

Nearest landmarks

Next prime40,927+21

Previous prime40,903−3

Distance to nearest prime3

Nearest square below40,804

Nearest square above41,209

Powers & multiples

40,906 to the power 21,673,300,836

40,906 to the power 368,448,043,997,416

40,906 to the power 42,799,935,687,758,298,896

40,906 to the power 5114,534,169,243,440,974,639,776

First ten multiples40,906, 81,812, 122,718, 163,624, 204,530, 245,436, 286,342, 327,248, 368,154, 409,060

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5No, remainder 1

Divisible by 6No, remainder 4

Divisible by 7No, remainder 5

Divisible by 8No, remainder 2

Divisible by 9No, remainder 1

Divisible by 10No, remainder 6

Divisible by 11No, remainder 8

Divisible by 12No, remainder 10

Divisible by 100No, remainder 6

Collatz (3n + 1) trajectory

Steps to reach 1137the total stopping time

Highest value reached61,3601× the starting value

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

First steps40,906 → 20,453 → 61,360 → 30,680 → 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,600%

40,906% as a decimal409.06

40,906% of 10040,906

40,906% of 1,000409,060

As a fraction of 10040,906/100

Read another way

As seconds11 hours, 21 minutes and 46 seconds

As bytes39.947 KiB

As a 24-bit colour#009FCA

Keep nerding

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