Recognised as Number

40,407

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value40,407

Digit count5

Digit sum15

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 13,469

Distinct prime factors23, 13,469

Number of divisors4

Sum of divisors σ(n)53,880

Aliquot sum13,473sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)13,468the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 26,936

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 13,469, 40,4074 in total

Arithmetic

Previous number40,406

Next number40,408

Double80,814

Half20,203.5

Square1,632,725,649

Cube65,973,545,299,143

Square root201.014924819≈irrational, shown to 9 decimal places

Cube root34.3151211≈

Negation-40,407

Reciprocal0.0000247482≈

Representations

Decimal40,407

Binary100111011101011116 bits

Octal116727

Hexadecimal9DD7

Base 36V6F

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

In wordsforty thousand, four hundred and seven

Ordinalforty thousand, four hundred and seventh

Scientific notation4.0407 × 10^4

Engineering notation40.407 × 10^3

In other bases

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

Quinary2243112base 5; one hand: 7 digits

Septenary225543base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001110111010111

Bit length16 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits5within that length

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

Bytes29d d7

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

At each machine width

16-bit1001110111010111

32-bit00000000000000001001110111010111

64-bit0000000000000000000000000000000000000000000000001001110111010111

One's complement0110001000101000at 16 bits, every bit flipped

Bits reversed1110101110111001at 16 bits

Rotated left by 10011101110101111at 16 bits, wrapping

Shifted left by 110011101110101110= 80,814, no wrap

Shifted right by 1100111011101011= 20,203, discarding the low bit

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

Nearest landmarks

Next prime40,423+16

Previous prime40,387−20

Distance to nearest prime16

Nearest square below40,401

Nearest square above40,804

Powers & multiples

40,407 to the power 21,632,725,649

40,407 to the power 365,973,545,299,143

40,407 to the power 42,665,793,044,902,471,201

40,407 to the power 5107,716,699,565,374,153,818,807

First ten multiples40,407, 80,814, 121,221, 161,628, 202,035, 242,442, 282,849, 323,256, 363,663, 404,070

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 3

Divisible by 8No, remainder 7

Divisible by 9No, remainder 6

Divisible by 10No, remainder 7

Divisible by 11No, remainder 4

Divisible by 12No, remainder 3

Divisible by 100No, remainder 7

Collatz (3n + 1) trajectory

Steps to reach 1137the total stopping time

Highest value reached272,7526× the starting value

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

First steps40,407 → 121,222 → 60,611 → 181,834 → 90,917 → 272,752 → 136,376 → 68,188 → 34,094 → 17,047 → …

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

As a percentage & fraction

As a percentage4,040,700%

40,407% as a decimal404.07

40,407% of 10040,407

40,407% of 1,000404,070

As a fraction of 10040,407/100

Read another way

As seconds11 hours, 13 minutes and 27 seconds

As bytes39.46 KiB

As a 24-bit colour#009DD7

Keep nerding

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