Recognised as Number

39,901

Positive
Odd
Prime
5 digits

39,901 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value39,901

Digit count5

Digit sum22

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation39,901

Distinct prime factors139,901

Number of divisors2

Sum of divisors σ(n)39,902

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)39,900the 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, 39,9012 in total

Arithmetic

Previous number39,900

Next number39,902

Double79,802

Half19,950.5

Square1,592,089,801

Cube63,525,975,149,701

Square root199.75234667≈irrational, shown to 9 decimal places

Cube root34.171281021≈

Negation-39,901

Reciprocal0.000025062≈

Representations

Decimal39,901

Binary100110111101110116 bits

Octal115735

Hexadecimal9BDD

Base 36USD

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

In wordsthirty-nine thousand, nine hundred and one

Ordinalthirty-nine thousand, nine hundred and first

Scientific notation3.9901 × 10^4

Engineering notation39.901 × 10^3

In other bases

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

Quinary2234101base 5; one hand: 7 digits

Septenary224221base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001101111011101

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

Bytes29b dd

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

At each machine width

16-bit1001101111011101

32-bit00000000000000001001101111011101

64-bit0000000000000000000000000000000000000000000000001001101111011101

One's complement0110010000100010at 16 bits, every bit flipped

Bits reversed1011101111011001at 16 bits

Rotated left by 10011011110111011at 16 bits, wrapping

Shifted left by 110011011110111010= 79,802, no wrap

Shifted right by 1100110111101110= 19,950, discarding the low bit

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

Nearest landmarks

Next prime39,929+28

Previous prime39,887−14

Distance to nearest prime0, it is prime

Nearest square below39,601

Nearest square above40,000

Powers & multiples

39,901 to the power 21,592,089,801

39,901 to the power 363,525,975,149,701

39,901 to the power 42,534,749,934,448,219,601

39,901 to the power 5101,139,057,134,418,410,299,501

First ten multiples39,901, 79,802, 119,703, 159,604, 199,505, 239,406, 279,307, 319,208, 359,109, 399,010

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 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 4

Divisible by 12No, remainder 1

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1168the total stopping time

Highest value reached182,0684× the starting value

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

First steps39,901 → 119,704 → 59,852 → 29,926 → 14,963 → 44,890 → 22,445 → 67,336 → 33,668 → 16,834 → …

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

As a percentage & fraction

As a percentage3,990,100%

39,901% as a decimal399.01

39,901% of 10039,901

39,901% of 1,000399,010

As a fraction of 10039,901/100

Read another way

As seconds11 hours, 5 minutes and 1 second

As bytes38.966 KiB

As a 24-bit colour#009BDD

Keep nerding

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