Nerdulator> put something in

Recognised as Number

47,909

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value47,909
Digit count5
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation23 × 2,083
Distinct prime factors223, 2,083
Number of divisors4
Sum of divisors σ(n)50,016
Aliquot sum2,107sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)45,804integers below n that share no factor with it
Carmichael function λ(n)22,902the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 45,804
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 23, 2,083, 47,9094 in total

Arithmetic

Previous number47,908
Next number47,910
Double95,818
Square root218.881246341≈irrational, shown to 9 decimal places
Cube root36.319430943≈
Negation-47,909
Reciprocal0.0000208729≈

Representations

Decimal47,909
Binary101110110010010116 bits
Octal135445
HexadecimalBB25
Base 3610YT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-seven thousand, nine hundred and nine
Ordinalforty-seven thousand, nine hundred and ninth
Scientific notation4.7909 × 10^4
Engineering notation47.909 × 10^3

In other bases

Ternary2102201102base 3; the most digit-efficient integer base after e: 10 digits
Quinary3013114base 5; one hand: 7 digits
Septenary256451base 7: 6 digits
Nonary72642base 9; each digit is two ternary digits: 5 digits
Duodecimal23885base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal5jf9base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal13:18:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T110T0111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100111101100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1011101100100101
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
Bytes2bb 25
Gray code1110011010110111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1011101100100101
32-bit00000000000000001011101100100101
64-bit0000000000000000000000000000000000000000000000001011101100100101
One's complement0100010011011010at 16 bits, every bit flipped
Bits reversed1010010011011101at 16 bits
Rotated left by 10111011001001011at 16 bits, wrapping
Shifted left by 110111011001001010= 95,818, no wrap
Shifted right by 1101110110010010= 23,954, discarding the low bit
These bits as a double2.3670191 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime47,911+2
Previous prime47,903−6
Distance to nearest prime2
Nearest square below47,524
Nearest square above47,961

Powers & multiples

47,909 to the power 22,295,272,281
47,909 to the power 3109,964,199,710,429
47,909 to the power 45,268,274,843,926,942,961
47,909 to the power 5252,397,779,497,695,910,318,549
First ten multiples47,909, 95,818, 143,727, 191,636, 239,545, 287,454, 335,363, 383,272, 431,181, 479,090
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 9

Collatz (3n + 1) trajectory

Steps to reach 1189the total stopping time
Highest value reached143,7283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps47,909 → 143,728 → 71,864 → 35,932 → 17,966 → 8,983 → 26,950 → 13,475 → 40,426 → 20,213 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,790,900%
47,909% as a decimal479.09
47,909% of 10047,909
47,909% of 1,000479,090
As a fraction of 10047,909/100

Read another way

As bytes46.786 KiB
As a 24-bit colour#00BB25

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “47909” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.