Recognised as Number

40,903

Positive
Odd
Prime
5 digits

40,903 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value40,903

Digit count5

Digit sum16

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation40,903

Distinct prime factors140,903

Number of divisors2

Sum of divisors σ(n)40,904

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)40,902the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 40,9032 in total

Arithmetic

Previous number40,902

Next number40,904

Double81,806

Half20,451.5

Square1,673,055,409

Cube68,432,985,394,327

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

Cube root34.454957673≈

Negation-40,903

Reciprocal0.0000244481≈

Representations

Decimal40,903

Binary100111111100011116 bits

Octal117707

Hexadecimal9FC7

Base 36VK7

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

In wordsforty thousand, nine hundred and three

Ordinalforty thousand, nine hundred and third

Scientific notation4.0903 × 10^4

Engineering notation40.903 × 10^3

In other bases

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

Quinary2302103base 5; one hand: 7 digits

Septenary230152base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001111111000111

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

Bytes29f c7

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

At each machine width

16-bit1001111111000111

32-bit00000000000000001001111111000111

64-bit0000000000000000000000000000000000000000000000001001111111000111

One's complement0110000000111000at 16 bits, every bit flipped

Bits reversed1110001111111001at 16 bits

Rotated left by 10011111110001111at 16 bits, wrapping

Shifted left by 110011111110001110= 81,806, no wrap

Shifted right by 1100111111100011= 20,451, discarding the low bit

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

Nearest landmarks

Next prime40,927+24

Previous prime40,897−6

Distance to nearest prime0, it is prime

Nearest square below40,804

Nearest square above41,209

Powers & multiples

40,903 to the power 21,673,055,409

40,903 to the power 368,432,985,394,327

40,903 to the power 42,799,114,401,584,157,281

40,903 to the power 5114,492,176,367,996,785,264,743

First ten multiples40,903, 81,806, 122,709, 163,612, 204,515, 245,418, 286,321, 327,224, 368,127, 409,030

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 7

Divisible by 9No, remainder 7

Divisible by 10No, remainder 3

Divisible by 11No, remainder 5

Divisible by 12No, remainder 7

Divisible by 100No, remainder 3

Collatz (3n + 1) trajectory

Steps to reach 1181the total stopping time

Highest value reached359,1528× the starting value

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

First steps40,903 → 122,710 → 61,355 → 184,066 → 92,033 → 276,100 → 138,050 → 69,025 → 207,076 → 103,538 → …

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

As a percentage & fraction

As a percentage4,090,300%

40,903% as a decimal409.03

40,903% of 10040,903

40,903% of 1,000409,030

As a fraction of 10040,903/100

Read another way

As seconds11 hours, 21 minutes and 43 seconds

As bytes39.944 KiB

As a 24-bit colour#009FC7

Keep nerding

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