Recognised as Number

64,005

Positive
Odd
Composite
5 digits

64,005 is an odd 5-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value64,005

Digit count5

Digit sum15

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 5 × 17 × 251

Distinct prime factors43, 5, 17, 251

Number of divisors16

Sum of divisors σ(n)108,864

Aliquot sum44,859sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,000the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 32,000

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 5, 15, 17, 51, 85, 251, 255, 753, 1,255, 3,765, 4,267, 12,801, 21,335, 64,00516 in total

Arithmetic

Previous number64,004

Next number64,006

Double128,010

Half32,002.5

Square4,096,640,025

Cube262,205,444,800,125

Square root252.992094738≈irrational, shown to 9 decimal places

Cube root40.00104164≈

Negation-64,005

Reciprocal0.0000156238≈

Representations

Decimal64,005

Binary111110100000010116 bits

Octal175005

HexadecimalFA05

Base 361DDX

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

In wordssixty-four thousand and five

Ordinalsixty-four thousand and fifth

Scientific notation6.4005 × 10^4

Engineering notation64.005 × 10^3

In other bases

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

Quinary4022010base 5; one hand: 7 digits

Septenary354414base 7: 6 digits

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

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

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

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

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

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

Bit-level

1111101000000101

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

Bit parityeven8 set bits, so even; not the same as the number itself being odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2fa 05

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

At each machine width

16-bit1111101000000101

32-bit00000000000000001111101000000101

64-bit0000000000000000000000000000000000000000000000001111101000000101

One's complement0000010111111010at 16 bits, every bit flipped

Bits reversed1010000001011111at 16 bits

Rotated left by 11111010000001011at 16 bits, wrapping

Shifted left by 111111010000001010= 128,010, no wrap

Shifted right by 1111110100000010= 32,002, discarding the low bit

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

Nearest landmarks

Next prime64,007+2

Previous prime63,997−8

Distance to nearest prime2

Nearest square below63,504

Nearest square above64,009

Powers & multiples

64,005 to the power 24,096,640,025

64,005 to the power 3262,205,444,800,125

64,005 to the power 416,782,459,494,432,000,625

64,005 to the power 51,074,161,319,941,120,200,003,125

First ten multiples64,005, 128,010, 192,015, 256,020, 320,025, 384,030, 448,035, 512,040, 576,045, 640,050

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 5

Divisible by 9No, remainder 6

Divisible by 10No, remainder 5

Divisible by 11No, remainder 7

Divisible by 12No, remainder 9

Divisible by 100No, remainder 5

Collatz (3n + 1) trajectory

Steps to reach 1148the total stopping time

Highest value reached192,0163× the starting value

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

First steps64,005 → 192,016 → 96,008 → 48,004 → 24,002 → 12,001 → 36,004 → 18,002 → 9,001 → 27,004 → …

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

As a percentage & fraction

As a percentage6,400,500%

64,005% as a decimal640.05

64,005% of 10064,005

64,005% of 1,000640,050

As a fraction of 10064,005/100

Read another way

As seconds17 hours, 46 minutes and 45 seconds

As bytes62.505 KiB

As a 24-bit colour#00FA05

Keep nerding

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