Recognised as Number
57,350
- Positive
- Even
- Composite
- 5 digits
57,350 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value57,350
Digit count5
Digit sum20
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 factorisation2 × 5^2 × 31 × 37
Distinct prime factors42, 5, 31, 37
Number of divisors24
Sum of divisors σ(n)113,088
Aliquot sum55,738sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)21,600integers below n that share no factor with it
Carmichael function λ(n)180the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 21,600
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 5, 10, 25, 31, 37, 50, 62, 74, 155, 185, 310, 370, 775, 925, 1,147, 1,550, 1,850, 2,294, 5,735, 11,470, 28,675, 57,35024 in total
Arithmetic
Representations
Decimal57,350
Binary111000000000011016 bits
Octal160006
HexadecimalE006
Base 361892
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-seven thousand, three hundred and fifty
Ordinalfifty-seven thousand, three hundred and fiftieth
Scientific notation5.735 × 10^4
Engineering notation57.35 × 10^3
In other bases
Ternary2220200002base 3; the most digit-efficient integer base after e: 10 digits
Quinary3313400base 5; one hand: 7 digits
Septenary326126base 7: 6 digits
Nonary86602base 9; each digit is two ternary digits: 5 digits
Duodecimal29232base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal737abase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal15:55:50base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary100T1T0001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010000000011010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110000000000110
Bit length16 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits11within that length
Bit parityodd5 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
Bytes2e0 06
Gray code1001000000000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110000000000110
32-bit00000000000000001110000000000110
64-bit0000000000000000000000000000000000000000000000001110000000000110
One's complement0001111111111001at 16 bits, every bit flipped
Bits reversed0110000000000111at 16 bits
Rotated left by 11100000000001101at 16 bits, wrapping
Shifted left by 111100000000001100= 114,700, no wrap
Shifted right by 1111000000000011= 28,675, discarding the low bit
These bits as a double2.83346648 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
57,350 to the power 23,289,022,500
57,350 to the power 3188,625,440,375,000
57,350 to the power 410,817,669,005,506,250,000
57,350 to the power 5620,393,317,465,783,437,500,000
First ten multiples57,350, 114,700, 172,050, 229,400, 286,750, 344,100, 401,450, 458,800, 516,150, 573,500
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 2
Divisible by 10Yes
Divisible by 11No, remainder 7
Divisible by 12No, remainder 2
Divisible by 100No, remainder 50
Collatz (3n + 1) trajectory
Steps to reach 178the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps57,350 → 28,675 → 86,026 → 43,013 → 129,040 → 64,520 → 32,260 → 16,130 → 8,065 → 24,196 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage5,735,000%
57,350% as a decimal573.5
57,350% of 10057,350
57,350% of 1,000573,500
As a fraction of 10057,350/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 57,350
Nerdulate something else
Nothing in mind? Surprise me · today’s page