Recognised as Number

63,001

Positive
Odd
Composite
Perfect square
5 digits

63,001 is an odd 5-digit integer and a composite number. It has 3 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value63,001

Digit count5

Digit sum10

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Perfect squareYes, 251²

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation251^2

Distinct prime factors1251

Number of divisors3

Sum of divisors σ(n)63,253

Aliquot sum252sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)62,750the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 251, 63,0013 in total

Arithmetic

Previous number63,000

Next number63,002

Double126,002

Half31,500.5

Square3,969,126,001

Cube250,058,907,189,001

Square root251exact

Cube root39.79078261≈

Negation-63,001

Reciprocal0.0000158728≈

Representations

Decimal63,001

Binary111101100001100116 bits

Octal173031

HexadecimalF619

Base 361CM1

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

In wordssixty-three thousand and one

Ordinalsixty-three thousand and first

Scientific notation6.3001 × 10^4

Engineering notation63.001 × 10^3

In other bases

Ternary10012102101base 3; the most digit-efficient integer base after e: 11 digits

Quinary4004001base 5; one hand: 7 digits

Septenary351451base 7: 6 digits

Nonary105371base 9; each digit is two ternary digits: 6 digits

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

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

Sexagesimal17:30:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1111011000011001

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 odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2f6 19

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

At each machine width

16-bit1111011000011001

32-bit00000000000000001111011000011001

64-bit0000000000000000000000000000000000000000000000001111011000011001

One's complement0000100111100110at 16 bits, every bit flipped

Bits reversed1001100001101111at 16 bits

Rotated left by 11110110000110011at 16 bits, wrapping

Shifted left by 111110110000110010= 126,002, no wrap

Shifted right by 1111101100001100= 31,500, discarding the low bit

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

Nearest landmarks

Next prime63,029+28

Previous prime62,989−12

Distance to nearest prime12

Nearest square below63,001

Nearest square above63,504

Powers & multiples

63,001 to the power 23,969,126,001

63,001 to the power 3250,058,907,189,001

63,001 to the power 415,753,961,211,814,252,001

63,001 to the power 5992,515,310,305,509,690,315,001

First ten multiples63,001, 126,002, 189,003, 252,004, 315,005, 378,006, 441,007, 504,008, 567,009, 630,010

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 1

Divisible by 9No, remainder 1

Divisible by 10No, remainder 1

Divisible by 11No, remainder 4

Divisible by 12No, remainder 1

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 186the total stopping time

Highest value reached255,4724× the starting value

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

First steps63,001 → 189,004 → 94,502 → 47,251 → 141,754 → 70,877 → 212,632 → 106,316 → 53,158 → 26,579 → …

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

As a percentage & fraction

As a percentage6,300,100%

63,001% as a decimal630.01

63,001% of 10063,001

63,001% of 1,000630,010

As a fraction of 10063,001/100

Read another way

As seconds17 hours, 30 minutes and 1 second

As bytes61.524 KiB

As a 24-bit colour#00F619

Keep nerding

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