Recognised as Number
40,926
- Positive
- Even
- Composite
- 5 digits
40,926 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value40,926
Digit count5
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2 × 3 × 19 × 359
Distinct prime factors42, 3, 19, 359
Number of divisors16
Sum of divisors σ(n)86,400
Aliquot sum45,474sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)12,888integers below n that share no factor with it
Carmichael function λ(n)3,222the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 12,888
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 19, 38, 57, 114, 359, 718, 1,077, 2,154, 6,821, 13,642, 20,463, 40,92616 in total
Arithmetic
Representations
Decimal40,926
Binary100111111101111016 bits
Octal117736
Hexadecimal9FDE
Base 36VKU
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty thousand, nine hundred and twenty-six
Ordinalforty thousand, nine hundred and twenty-sixth
Scientific notation4.0926 × 10^4
Engineering notation40.926 × 10^3
In other bases
Ternary2002010210base 3; the most digit-efficient integer base after e: 10 digits
Quinary2302201base 5; one hand: 7 digits
Septenary230214base 7: 6 digits
Nonary62123base 9; each digit is two ternary digits: 5 digits
Duodecimal1b826base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal5266base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal11:22:6base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T01T011T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110000000100010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1001111111011110
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 even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes29f de
Gray code1101000000110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1001111111011110
32-bit00000000000000001001111111011110
64-bit0000000000000000000000000000000000000000000000001001111111011110
One's complement0110000000100001at 16 bits, every bit flipped
Bits reversed0111101111111001at 16 bits
Rotated left by 10011111110111101at 16 bits, wrapping
Shifted left by 110011111110111100= 81,852, no wrap
Shifted right by 1100111111101111= 20,463, discarding the low bit
These bits as a double2.02201306 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
40,926 to the power 21,674,937,476
40,926 to the power 368,548,491,142,776
40,926 to the power 42,805,415,548,509,250,576
40,926 to the power 5114,814,436,738,289,589,073,376
First ten multiples40,926, 81,852, 122,778, 163,704, 204,630, 245,556, 286,482, 327,408, 368,334, 409,260
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6Yes
Divisible by 7No, remainder 4
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10No, remainder 6
Divisible by 11No, remainder 6
Divisible by 12No, remainder 6
Divisible by 100No, remainder 26
Collatz (3n + 1) trajectory
Steps to reach 1137the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps40,926 → 20,463 → 61,390 → 30,695 → 92,086 → 46,043 → 138,130 → 69,065 → 207,196 → 103,598 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage4,092,600%
40,926% as a decimal409.26
40,926% of 10040,926
40,926% of 1,000409,260
As a fraction of 10040,926/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 40,926
Nerdulate something else
Nothing in mind? Surprise me · today’s page