Recognised as Number

47,577

Positive
Odd
Composite
5 digits

47,577 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value47,577

Digit count5

Digit sum30

Digit product6,860

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 15,859

Distinct prime factors23, 15,859

Number of divisors4

Sum of divisors σ(n)63,440

Aliquot sum15,863sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)15,858the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 31,716

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 15,859, 47,5774 in total

Arithmetic

Previous number47,576

Next number47,578

Double95,154

Half23,788.5

Square2,263,570,929

Cube107,693,914,089,033

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

Cube root36.235340882≈

Negation-47,577

Reciprocal0.0000210186≈

Representations

Decimal47,577

Binary101110011101100116 bits

Octal134731

HexadecimalB9D9

Base 3610PL

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

In wordsforty-seven thousand, five hundred and seventy-seven

Ordinalforty-seven thousand, five hundred and seventy-seventh

Scientific notation4.7577 × 10^4

Engineering notation47.577 × 10^3

In other bases

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

Quinary3010302base 5; one hand: 7 digits

Septenary255465base 7: 6 digits

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

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

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

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

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

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

Bit-level

1011100111011001

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2b9 d9

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

At each machine width

16-bit1011100111011001

32-bit00000000000000001011100111011001

64-bit0000000000000000000000000000000000000000000000001011100111011001

One's complement0100011000100110at 16 bits, every bit flipped

Bits reversed1001101110011101at 16 bits

Rotated left by 10111001110110011at 16 bits, wrapping

Shifted left by 110111001110110010= 95,154, no wrap

Shifted right by 1101110011101100= 23,788, discarding the low bit

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

Nearest landmarks

Next prime47,581+4

Previous prime47,569−8

Distance to nearest prime4

Nearest square below47,524

Nearest square above47,961

Powers & multiples

47,577 to the power 22,263,570,929

47,577 to the power 3107,693,914,089,033

47,577 to the power 45,123,753,350,613,923,041

47,577 to the power 5243,772,813,162,158,616,521,657

First ten multiples47,577, 95,154, 142,731, 190,308, 237,885, 285,462, 333,039, 380,616, 428,193, 475,770

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 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 1

Divisible by 9No, remainder 3

Divisible by 10No, remainder 7

Divisible by 11No, remainder 2

Divisible by 12No, remainder 9

Divisible by 100No, remainder 77

Collatz (3n + 1) trajectory

Steps to reach 1145the total stopping time

Highest value reached160,5763× the starting value

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

First steps47,577 → 142,732 → 71,366 → 35,683 → 107,050 → 53,525 → 160,576 → 80,288 → 40,144 → 20,072 → …

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

As a percentage & fraction

As a percentage4,757,700%

47,577% as a decimal475.77

47,577% of 10047,577

47,577% of 1,000475,770

As a fraction of 10047,577/100

Read another way

As seconds13 hours, 12 minutes and 57 seconds

As bytes46.462 KiB

As a 24-bit colour#00B9D9

Keep nerding

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