Recognised as Number

47,033

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value47,033

Digit count5

Digit sum17

Digit product0zero, because one of the digits is zero

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 6,719

Distinct prime factors27, 6,719

Number of divisors4

Sum of divisors σ(n)53,760

Aliquot sum6,727sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)20,154the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 40,308

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

SquarefreeYesno repeated prime factor

All divisors1, 7, 6,719, 47,0334 in total

Arithmetic

Previous number47,032

Next number47,034

Double94,066

Half23,516.5

Square2,212,103,089

Cube104,041,844,584,937

Square root216.870929357≈irrational, shown to 9 decimal places

Cube root36.096705014≈

Negation-47,033

Reciprocal0.0000212617≈

Representations

Decimal47,033

Binary101101111011100116 bits

Octal133671

HexadecimalB7B9

Base 3610AH

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

In wordsforty-seven thousand and thirty-three

Ordinalforty-seven thousand and thirty-third

Scientific notation4.7033 × 10^4

Engineering notation47.033 × 10^3

In other bases

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

Quinary3001113base 5; one hand: 7 digits

Septenary254060base 7: 6 digits

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

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

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

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

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

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

Bit-level

1011011110111001

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

Bytes2b7 b9

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

At each machine width

16-bit1011011110111001

32-bit00000000000000001011011110111001

64-bit0000000000000000000000000000000000000000000000001011011110111001

One's complement0100100001000110at 16 bits, every bit flipped

Bits reversed1001110111101101at 16 bits

Rotated left by 10110111101110011at 16 bits, wrapping

Shifted left by 110110111101110010= 94,066, no wrap

Shifted right by 1101101111011100= 23,516, discarding the low bit

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

Nearest landmarks

Next prime47,041+8

Previous prime47,017−16

Distance to nearest prime8

Nearest square below46,656

Nearest square above47,089

Powers & multiples

47,033 to the power 22,212,103,089

47,033 to the power 3104,041,844,584,937

47,033 to the power 44,893,400,076,363,341,921

47,033 to the power 5230,151,285,791,597,060,570,393

First ten multiples47,033, 94,066, 141,099, 188,132, 235,165, 282,198, 329,231, 376,264, 423,297, 470,330

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 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7Yes

Divisible by 8No, remainder 1

Divisible by 9No, remainder 8

Divisible by 10No, remainder 3

Divisible by 11No, remainder 8

Divisible by 12No, remainder 5

Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 1145the total stopping time

Highest value reached158,7403× the starting value

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

First steps47,033 → 141,100 → 70,550 → 35,275 → 105,826 → 52,913 → 158,740 → 79,370 → 39,685 → 119,056 → …

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

As a percentage & fraction

As a percentage4,703,300%

47,033% as a decimal470.33

47,033% of 10047,033

47,033% of 1,000470,330

As a fraction of 10047,033/100

Read another way

As seconds13 hours, 3 minutes and 53 seconds

As bytes45.931 KiB

As a 24-bit colour#00B7B9

Keep nerding

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