Nerdulator> put something in

Recognised as Number

63,008

  • Positive
  • Even
  • Composite
  • 5 digits

63,008 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 8.

Number properties

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

Factors & divisors

Prime factorisation2^5 × 11 × 179
Distinct prime factors32, 11, 179
Number of divisors24
Sum of divisors σ(n)136,080
Aliquot sum73,072sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)28,480integers below n that share no factor with it
Carmichael function λ(n)3,560the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 28,480
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 11, 16, 22, 32, 44, 88, 176, 179, 352, 358, 716, 1,432, 1,969, 2,864, 3,938, 5,728, 7,876, 15,752, 31,504, 63,00824 in total

Arithmetic

Previous number63,007
Next number63,009
Double126,016
Half31,504
Square root251.013943836≈irrational, shown to 9 decimal places
Cube root39.792256265≈
Negation-63,008
Reciprocal0.000015871≈

Representations

Decimal63,008
Binary111101100010000016 bits
Octal173040
HexadecimalF620
Base 361CM8
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-three thousand and eight
Ordinalsixty-three thousand and eighth
Scientific notation6.3008 × 10^4
Engineering notation63.008 × 10^3

In other bases

Ternary10012102122base 3; the most digit-efficient integer base after e: 11 digits
Quinary4004013base 5; one hand: 7 digits
Septenary351461base 7: 6 digits
Nonary105378base 9; each digit is two ternary digits: 6 digits
Duodecimal30568base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal7ha8base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal17:30:8base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary101TT110T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000101001100000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111011000100000
Bit length16 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits9within that length
Bit parityodd7 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 20
Gray code1000110100110000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111011000100000
32-bit00000000000000001111011000100000
64-bit0000000000000000000000000000000000000000000000001111011000100000
One's complement0000100111011111at 16 bits, every bit flipped
Bits reversed0000010001101111at 16 bits
Rotated left by 11110110001000001at 16 bits, wrapping
Shifted left by 111110110001000000= 126,016, no wrap
Shifted right by 1111101100010000= 31,504, discarding the low bit
These bits as a double3.11300882 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime63,029+21
Previous prime62,989−19
Distance to nearest prime19
Nearest square below63,001
Nearest square above63,504

Powers & multiples

63,008 to the power 23,970,008,064
63,008 to the power 3250,142,268,096,512
63,008 to the power 415,760,964,028,225,028,096
63,008 to the power 5993,066,821,490,402,570,272,768
First ten multiples63,008, 126,016, 189,024, 252,032, 315,040, 378,048, 441,056, 504,064, 567,072, 630,080
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 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7No, remainder 1
Divisible by 8Yes
Divisible by 9No, remainder 8
Divisible by 10No, remainder 8
Divisible by 11Yes
Divisible by 12No, remainder 8
Divisible by 100No, remainder 8

Collatz (3n + 1) trajectory

Steps to reach 129the total stopping time
Highest value reached63,008
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps63,008 → 31,504 → 15,752 → 7,876 → 3,938 → 1,969 → 5,908 → 2,954 → 1,477 → 4,432 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,300,800%
63,008% as a decimal630.08
63,008% of 10063,008
63,008% of 1,000630,080
As a fraction of 10063,008/100

Read another way

As bytes61.531 KiB
As a 24-bit colour#00F620

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