Recognised as Number

47,733

Positive
Odd
Composite
5 digits

47,733 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value47,733

Digit count5

Digit sum24

Digit product1,764

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 7 × 2,273

Distinct prime factors33, 7, 2,273

Number of divisors8

Sum of divisors σ(n)72,768

Aliquot sum25,035sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)6,816the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 27,264

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 7, 21, 2,273, 6,819, 15,911, 47,7338 in total

Arithmetic

Previous number47,732

Next number47,734

Double95,466

Half23,866.5

Square2,278,439,289

Cube108,756,742,581,837

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

Cube root36.274901638≈

Negation-47,733

Reciprocal0.0000209499≈

Representations

Decimal47,733

Binary101110100111010116 bits

Octal135165

HexadecimalBA75

Base 3610TX

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

In wordsforty-seven thousand, seven hundred and thirty-three

Ordinalforty-seven thousand, seven hundred and thirty-third

Scientific notation4.7733 × 10^4

Engineering notation47.733 × 10^3

In other bases

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

Quinary3011413base 5; one hand: 7 digits

Septenary256110base 7: 6 digits

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

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

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

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

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

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

Bit-level

1011101001110101

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

Bytes2ba 75

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

At each machine width

16-bit1011101001110101

32-bit00000000000000001011101001110101

64-bit0000000000000000000000000000000000000000000000001011101001110101

One's complement0100010110001010at 16 bits, every bit flipped

Bits reversed1010111001011101at 16 bits

Rotated left by 10111010011101011at 16 bits, wrapping

Shifted left by 110111010011101010= 95,466, no wrap

Shifted right by 1101110100111010= 23,866, discarding the low bit

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

Nearest landmarks

Next prime47,737+4

Previous prime47,717−16

Distance to nearest prime4

Nearest square below47,524

Nearest square above47,961

Powers & multiples

47,733 to the power 22,278,439,289

47,733 to the power 3108,756,742,581,837

47,733 to the power 45,191,285,593,658,825,521

47,733 to the power 5247,795,635,242,116,718,593,893

First ten multiples47,733, 95,466, 143,199, 190,932, 238,665, 286,398, 334,131, 381,864, 429,597, 477,330

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 3

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 6

Divisible by 10No, remainder 3

Divisible by 11No, remainder 4

Divisible by 12No, remainder 9

Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 1145the total stopping time

Highest value reached143,2003× the starting value

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

First steps47,733 → 143,200 → 71,600 → 35,800 → 17,900 → 8,950 → 4,475 → 13,426 → 6,713 → 20,140 → …

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

As a percentage & fraction

As a percentage4,773,300%

47,733% as a decimal477.33

47,733% of 10047,733

47,733% of 1,000477,330

As a fraction of 10047,733/100

Read another way

As seconds13 hours, 15 minutes and 33 seconds

As bytes46.614 KiB

As a 24-bit colour#00BA75

Keep nerding

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