Recognised as Number
63,200
- Positive
- Even
- Composite
- 5 digits
63,200 is an even 5-digit integer and a composite number. It has 36 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value63,200
Digit count5
Digit sum11
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^5 × 5^2 × 79
Distinct prime factors32, 5, 79
Number of divisors36
Sum of divisors σ(n)156,240
Aliquot sum93,040sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)24,960integers below n that share no factor with it
Carmichael function λ(n)1,560the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 24,960
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 40, 50, 79, 80, 100, 158, 160, 200, 316, 395, 400, 632, 790, 800, 1,264, 1,580, 1,975, 2,528, 3,160, 3,950, 6,320, 7,900, 12,640, 15,800, 31,600, 63,20036 in total
Arithmetic
Representations
Decimal63,200
Binary111101101110000016 bits
Octal173340
HexadecimalF6E0
Base 361CRK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-three thousand, two hundred
Ordinalsixty-three thousand, two hundredth
Scientific notation6.32 × 10^4
Engineering notation63.2 × 10^3
In other bases
Ternary10012200202base 3; the most digit-efficient integer base after e: 11 digits
Quinary4010300base 5; one hand: 7 digits
Septenary352154base 7: 6 digits
Nonary105622base 9; each digit is two ternary digits: 6 digits
Duodecimal306a8base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal7i00base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal17:33:20base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary101T0T01T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000101100100000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111011011100000
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 even
Highest set bitbit 15worth 32,768
Lowest set bitbit 55 trailing zeros
Power of twoNo
Bytes2f6 e0
Gray code1000110110010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111011011100000
32-bit00000000000000001111011011100000
64-bit0000000000000000000000000000000000000000000000001111011011100000
One's complement0000100100011111at 16 bits, every bit flipped
Bits reversed0000011101101111at 16 bits
Rotated left by 11110110111000001at 16 bits, wrapping
Shifted left by 111110110111000000= 126,400, no wrap
Shifted right by 1111101101110000= 31,600, discarding the low bit
These bits as a double3.12249488 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
63,200 to the power 23,994,240,000
63,200 to the power 3252,435,968,000,000
63,200 to the power 415,953,953,177,600,000,000
63,200 to the power 51,008,289,840,824,320,000,000,000
First ten multiples63,200, 126,400, 189,600, 252,800, 316,000, 379,200, 442,400, 505,600, 568,800, 632,000
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 4
Divisible by 8Yes
Divisible by 9No, remainder 2
Divisible by 10Yes
Divisible by 11No, remainder 5
Divisible by 12No, remainder 8
Divisible by 100Yes
Collatz (3n + 1) trajectory
Steps to reach 142the total stopping time
Highest value reached63,200
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps63,200 → 31,600 → 15,800 → 7,900 → 3,950 → 1,975 → 5,926 → 2,963 → 8,890 → 4,445 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage6,320,000%
63,200% as a decimal632
63,200% of 10063,200
63,200% of 1,000632,000
As a fraction of 10063,200/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 63,200
Nerdulate something else
Nothing in mind? Surprise me · today’s page