Recognised as Number

40,708

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value40,708

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^2 × 10,177

Distinct prime factors22, 10,177

Number of divisors6

Sum of divisors σ(n)71,246

Aliquot sum30,538sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 10,177, 20,354, 40,7086 in total

Arithmetic

Previous number40,707

Next number40,709

Double81,416

Half20,354

Square1,657,141,264

Cube67,458,906,574,912

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

Cube root34.40011718≈

Negation-40,708

Reciprocal0.0000245652≈

Representations

Decimal40,708

Binary100111110000010016 bits

Octal117404

Hexadecimal9F04

Base 36VES

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

In wordsforty thousand, seven hundred and eight

Ordinalforty thousand, seven hundred and eighth

Scientific notation4.0708 × 10^4

Engineering notation40.708 × 10^3

In other bases

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

Quinary2300313base 5; one hand: 7 digits

Septenary226453base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001111100000100

Bit length16 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits9within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes29f 04

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

At each machine width

16-bit1001111100000100

32-bit00000000000000001001111100000100

64-bit0000000000000000000000000000000000000000000000001001111100000100

One's complement0110000011111011at 16 bits, every bit flipped

Bits reversed0010000011111001at 16 bits

Rotated left by 10011111000001001at 16 bits, wrapping

Shifted left by 110011111000001000= 81,416, no wrap

Shifted right by 1100111110000010= 20,354, discarding the low bit

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

Nearest landmarks

Next prime40,709+1

Previous prime40,699−9

Distance to nearest prime1

Nearest square below40,401

Nearest square above40,804

Powers & multiples

40,708 to the power 21,657,141,264

40,708 to the power 367,458,906,574,912

40,708 to the power 42,746,117,168,851,517,696

40,708 to the power 5111,788,937,709,607,582,368,768

First ten multiples40,708, 81,416, 122,124, 162,832, 203,540, 244,248, 284,956, 325,664, 366,372, 407,080

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5No, remainder 3

Divisible by 6No, remainder 4

Divisible by 7No, remainder 3

Divisible by 8No, remainder 4

Divisible by 9No, remainder 1

Divisible by 10No, remainder 8

Divisible by 11No, remainder 8

Divisible by 12No, remainder 4

Divisible by 100No, remainder 8

Collatz (3n + 1) trajectory

Steps to reach 136the total stopping time

Highest value reached40,708

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

First steps40,708 → 20,354 → 10,177 → 30,532 → 15,266 → 7,633 → 22,900 → 11,450 → 5,725 → 17,176 → …

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

As a percentage & fraction

As a percentage4,070,800%

40,708% as a decimal407.08

40,708% of 10040,708

40,708% of 1,000407,080

As a fraction of 10040,708/100

Read another way

As seconds11 hours, 18 minutes and 28 seconds

As bytes39.754 KiB

As a 24-bit colour#009F04

Keep nerding

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