Recognised as Number

47,590

Positive
Even
Composite
5 digits

47,590 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value47,590

Digit count5

Digit sum25

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 4,759

Distinct prime factors32, 5, 4,759

Number of divisors8

Sum of divisors σ(n)85,680

Aliquot sum38,090sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)9,516the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 19,032

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 4,759, 9,518, 23,795, 47,5908 in total

Arithmetic

Previous number47,589

Next number47,591

Double95,180

Half23,795

Square2,264,808,100

Cube107,782,217,479,000

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

Cube root36.238640912≈

Negation-47,590

Reciprocal0.0000210128≈

Representations

Decimal47,590

Binary101110011110011016 bits

Octal134746

HexadecimalB9E6

Base 3610PY

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

In wordsforty-seven thousand, five hundred and ninety

Ordinalforty-seven thousand, five hundred and ninetieth

Scientific notation4.759 × 10^4

Engineering notation47.59 × 10^3

In other bases

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

Quinary3010330base 5; one hand: 7 digits

Septenary255514base 7: 6 digits

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

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

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

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

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

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

Bit-level

1011100111100110

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 even

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes2b9 e6

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

At each machine width

16-bit1011100111100110

32-bit00000000000000001011100111100110

64-bit0000000000000000000000000000000000000000000000001011100111100110

One's complement0100011000011001at 16 bits, every bit flipped

Bits reversed0110011110011101at 16 bits

Rotated left by 10111001111001101at 16 bits, wrapping

Shifted left by 110111001111001100= 95,180, no wrap

Shifted right by 1101110011110011= 23,795, discarding the low bit

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

Nearest landmarks

Next prime47,591+1

Previous prime47,581−9

Distance to nearest prime1

Nearest square below47,524

Nearest square above47,961

Powers & multiples

47,590 to the power 22,264,808,100

47,590 to the power 3107,782,217,479,000

47,590 to the power 45,129,355,729,825,610,000

47,590 to the power 5244,106,039,182,400,779,900,000

First ten multiples47,590, 95,180, 142,770, 190,360, 237,950, 285,540, 333,130, 380,720, 428,310, 475,900

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6No, remainder 4

Divisible by 7No, remainder 4

Divisible by 8No, remainder 6

Divisible by 9No, remainder 7

Divisible by 10Yes

Divisible by 11No, remainder 4

Divisible by 12No, remainder 10

Divisible by 100No, remainder 90

Collatz (3n + 1) trajectory

Steps to reach 175the total stopping time

Highest value reached107,0802× the starting value

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

First steps47,590 → 23,795 → 71,386 → 35,693 → 107,080 → 53,540 → 26,770 → 13,385 → 40,156 → 20,078 → …

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

As a percentage & fraction

As a percentage4,759,000%

47,590% as a decimal475.9

47,590% of 10047,590

47,590% of 1,000475,900

As a fraction of 10047,590/100

Read another way

As seconds13 hours, 13 minutes and 10 seconds

As bytes46.475 KiB

As a 24-bit colour#00B9E6

Keep nerding

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