Recognised as Number

47,409

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value47,409

Digit count5

Digit sum24

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 × 15,803

Distinct prime factors23, 15,803

Number of divisors4

Sum of divisors σ(n)63,216

Aliquot sum15,807sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 15,803, 47,4094 in total

Arithmetic

Previous number47,408

Next number47,410

Double94,818

Half23,704.5

Square2,247,613,281

Cube106,557,098,038,929

Square root217.736078774≈irrational, shown to 9 decimal places

Cube root36.192640161≈

Negation-47,409

Reciprocal0.000021093≈

Representations

Decimal47,409

Binary101110010011000116 bits

Octal134461

HexadecimalB931

Base 3610KX

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

In wordsforty-seven thousand, four hundred and nine

Ordinalforty-seven thousand, four hundred and ninth

Scientific notation4.7409 × 10^4

Engineering notation47.409 × 10^3

In other bases

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

Quinary3004114base 5; one hand: 7 digits

Septenary255135base 7: 6 digits

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

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

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

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

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

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

Bit-level

1011100100110001

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

Bit parityeven8 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 31

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

At each machine width

16-bit1011100100110001

32-bit00000000000000001011100100110001

64-bit0000000000000000000000000000000000000000000000001011100100110001

One's complement0100011011001110at 16 bits, every bit flipped

Bits reversed1000110010011101at 16 bits

Rotated left by 10111001001100011at 16 bits, wrapping

Shifted left by 110111001001100010= 94,818, no wrap

Shifted right by 1101110010011000= 23,704, discarding the low bit

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

Nearest landmarks

Next prime47,417+8

Previous prime47,407−2

Distance to nearest prime2

Nearest square below47,089

Nearest square above47,524

Powers & multiples

47,409 to the power 22,247,613,281

47,409 to the power 3106,557,098,038,929

47,409 to the power 45,051,765,460,927,584,961

47,409 to the power 5239,499,148,737,115,875,416,049

First ten multiples47,409, 94,818, 142,227, 189,636, 237,045, 284,454, 331,863, 379,272, 426,681, 474,090

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 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 1

Divisible by 9No, remainder 6

Divisible by 10No, remainder 9

Divisible by 11No, remainder 10

Divisible by 12No, remainder 9

Divisible by 100No, remainder 9

Collatz (3n + 1) trajectory

Steps to reach 1189the total stopping time

Highest value reached250,5045× the starting value

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

First steps47,409 → 142,228 → 71,114 → 35,557 → 106,672 → 53,336 → 26,668 → 13,334 → 6,667 → 20,002 → …

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

As a percentage & fraction

As a percentage4,740,900%

47,409% as a decimal474.09

47,409% of 10047,409

47,409% of 1,000474,090

As a fraction of 10047,409/100

Read another way

As seconds13 hours, 10 minutes and 9 seconds

As bytes46.298 KiB

As a 24-bit colour#00B931

Keep nerding

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