Nerdulator> put something in

Recognised as Number

47,907

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value47,907
Digit count5
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 5,323
Distinct prime factors23, 5,323
Number of divisors6
Sum of divisors σ(n)69,212
Aliquot sum21,305sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)31,932integers below n that share no factor with it
Carmichael function λ(n)5,322the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 31,932
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 5,323, 15,969, 47,9076 in total

Arithmetic

Previous number47,906
Next number47,908
Double95,814
Square root218.876677606≈irrational, shown to 9 decimal places
Cube root36.318925541≈
Negation-47,907
Reciprocal0.0000208738≈

Representations

Decimal47,907
Binary101110110010001116 bits
Octal135443
HexadecimalBB23
Base 3610YR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-seven thousand, nine hundred and seven
Ordinalforty-seven thousand, nine hundred and seventh
Scientific notation4.7907 × 10^4
Engineering notation47.907 × 10^3

In other bases

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

Bit-level

1011101100100011
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 23
Gray code1110011010110010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1011101100100011
32-bit00000000000000001011101100100011
64-bit0000000000000000000000000000000000000000000000001011101100100011
One's complement0100010011011100at 16 bits, every bit flipped
Bits reversed1100010011011101at 16 bits
Rotated left by 10111011001000111at 16 bits, wrapping
Shifted left by 110111011001000110= 95,814, no wrap
Shifted right by 1101110110010001= 23,953, discarding the low bit
These bits as a double2.36692029 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime47,911+4
Previous prime47,903−4
Distance to nearest prime4
Nearest square below47,524
Nearest square above47,961

Powers & multiples

47,907 to the power 22,295,080,649
47,907 to the power 3109,950,428,651,643
47,907 to the power 45,267,395,185,414,261,201
47,907 to the power 5252,345,101,147,641,011,356,307
First ten multiples47,907, 95,814, 143,721, 191,628, 239,535, 287,442, 335,349, 383,256, 431,163, 479,070
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 7

Collatz (3n + 1) trajectory

Steps to reach 1189the total stopping time
Highest value reached215,5844× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps47,907 → 143,722 → 71,861 → 215,584 → 107,792 → 53,896 → 26,948 → 13,474 → 6,737 → 20,212 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,790,700%
47,907% as a decimal479.07
47,907% of 10047,907
47,907% of 1,000479,070
As a fraction of 10047,907/100

Read another way

As bytes46.784 KiB
As a 24-bit colour#00BB23

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 “47907” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.