Nerdulator> put something in

Recognised as Number

57,190

  • Positive
  • Even
  • Composite
  • 5 digits

57,190 is an even 5-digit integer and a composite number. It has 32 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value57,190
Digit count5
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 7 × 19 × 43
Distinct prime factors52, 5, 7, 19, 43
Number of divisors32
Sum of divisors σ(n)126,720
Aliquot sum69,530sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)18,144integers below n that share no factor with it
Carmichael function λ(n)252the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 18,144
Möbius function μ(n)−15 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 7, 10, 14, 19, 35, 38, 43, 70, 86, 95, 133, 190, 215, 266, 301, 430, 602, 665, 817, 1,330, 1,505, 1,634, 3,010, 4,085, 5,719, 8,170, 11,438, 28,595, 57,19032 in total

Arithmetic

Previous number57,189
Next number57,191
Double114,380
Half28,595
Square root239.144307898≈irrational, shown to 9 decimal places
Cube root38.527725012≈
Negation-57,190
Reciprocal0.0000174856≈

Representations

Decimal57,190
Binary110111110110011016 bits
Octal157546
HexadecimalDF66
Base 36184M
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-seven thousand, one hundred and ninety
Ordinalfifty-seven thousand, one hundred and ninetieth
Scientific notation5.719 × 10^4
Engineering notation57.19 × 10^3

In other bases

Ternary2220110011base 3; the most digit-efficient integer base after e: 10 digits
Quinary3312230base 5; one hand: 7 digits
Septenary325510base 7: 6 digits
Nonary86404base 9; each digit is two ternary digits: 5 digits
Duodecimal2911abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal72jabase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal15:53:10base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary100T0110011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010000010111010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1101111101100110
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 even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes2df 66
Gray code1011000011010101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1101111101100110
32-bit00000000000000001101111101100110
64-bit0000000000000000000000000000000000000000000000001101111101100110
One's complement0010000010011001at 16 bits, every bit flipped
Bits reversed0110011011111011at 16 bits
Rotated left by 11011111011001101at 16 bits, wrapping
Shifted left by 111011111011001100= 114,380, no wrap
Shifted right by 1110111110110011= 28,595, discarding the low bit
These bits as a double2.82556143 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime57,191+1
Previous prime57,179−11
Distance to nearest prime1
Nearest square below57,121
Nearest square above57,600

Powers & multiples

57,190 to the power 23,270,696,100
57,190 to the power 3187,051,109,959,000
57,190 to the power 410,697,452,978,555,210,000
57,190 to the power 5611,787,335,843,572,459,900,000
First ten multiples57,190, 114,380, 171,570, 228,760, 285,950, 343,140, 400,330, 457,520, 514,710, 571,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 7Yes
Divisible by 8No, remainder 6
Divisible by 9No, remainder 4
Divisible by 10Yes
Divisible by 11No, remainder 1
Divisible by 12No, remainder 10
Divisible by 100No, remainder 90

Collatz (3n + 1) trajectory

Steps to reach 178the total stopping time
Highest value reached128,6802× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps57,190 → 28,595 → 85,786 → 42,893 → 128,680 → 64,340 → 32,170 → 16,085 → 48,256 → 24,128 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,719,000%
57,190% as a decimal571.9
57,190% of 10057,190
57,190% of 1,000571,900
As a fraction of 10057,190/100

Read another way

As bytes55.85 KiB
As a 24-bit colour#00DF66

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