Recognised as Number

47,639

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value47,639

Digit count5

Digit sum29

Digit product4,536

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation47,639

Distinct prime factors147,639

Number of divisors2

Sum of divisors σ(n)47,640

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)47,638the 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, 47,6392 in total

Arithmetic

Previous number47,638

Next number47,640

Double95,278

Half23,819.5

Square2,269,474,321

Cube108,115,487,178,119

Square root218.263602096≈irrational, shown to 9 decimal places

Cube root36.251074086≈

Negation-47,639

Reciprocal0.0000209912≈

Representations

Decimal47,639

Binary101110100001011116 bits

Octal135027

HexadecimalBA17

Base 3610RB

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

In wordsforty-seven thousand, six hundred and thirty-nine

Ordinalforty-seven thousand, six hundred and thirty-ninth

Scientific notation4.7639 × 10^4

Engineering notation47.639 × 10^3

In other bases

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

Quinary3011024base 5; one hand: 7 digits

Septenary255614base 7: 6 digits

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

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

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

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

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

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

Bit-level

1011101000010111

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

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

Bytes2ba 17

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

At each machine width

16-bit1011101000010111

32-bit00000000000000001011101000010111

64-bit0000000000000000000000000000000000000000000000001011101000010111

One's complement0100010111101000at 16 bits, every bit flipped

Bits reversed1110100001011101at 16 bits

Rotated left by 10111010000101111at 16 bits, wrapping

Shifted left by 110111010000101110= 95,278, no wrap

Shifted right by 1101110100001011= 23,819, discarding the low bit

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

Nearest landmarks

Next prime47,653+14

Previous prime47,629−10

Distance to nearest prime0, it is prime

Nearest square below47,524

Nearest square above47,961

Powers & multiples

47,639 to the power 22,269,474,321

47,639 to the power 3108,115,487,178,119

47,639 to the power 45,150,513,693,678,411,041

47,639 to the power 5245,365,321,853,145,823,582,199

First ten multiples47,639, 95,278, 142,917, 190,556, 238,195, 285,834, 333,473, 381,112, 428,751, 476,390

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 2

Divisible by 10No, remainder 9

Divisible by 11No, remainder 9

Divisible by 12No, remainder 11

Divisible by 100No, remainder 39

Collatz (3n + 1) trajectory

Steps to reach 1145the total stopping time

Highest value reached321,5686× the starting value

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

First steps47,639 → 142,918 → 71,459 → 214,378 → 107,189 → 321,568 → 160,784 → 80,392 → 40,196 → 20,098 → …

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

As a percentage & fraction

As a percentage4,763,900%

47,639% as a decimal476.39

47,639% of 10047,639

47,639% of 1,000476,390

As a fraction of 10047,639/100

Read another way

As seconds13 hours, 13 minutes and 59 seconds

As bytes46.522 KiB

As a 24-bit colour#00BA17

Keep nerding

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