Recognised as Number

64,629

Positive
Odd
Composite
5 digits

64,629 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value64,629

Digit count5

Digit sum27

Digit product2,592

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 43 × 167

Distinct prime factors33, 43, 167

Number of divisors12

Sum of divisors σ(n)96,096

Aliquot sum31,467sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)3,486the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 41,832

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 43, 129, 167, 387, 501, 1,503, 7,181, 21,543, 64,62912 in total

Arithmetic

Previous number64,628

Next number64,630

Double129,258

Half32,314.5

Square4,176,907,641

Cube269,949,363,930,189

Square root254.222343629≈irrational, shown to 9 decimal places

Cube root40.130614697≈

Negation-64,629

Reciprocal0.0000154729≈

Representations

Decimal64,629

Binary111111000111010116 bits

Octal176165

HexadecimalFC75

Base 361DV9

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

In wordssixty-four thousand, six hundred and twenty-nine

Ordinalsixty-four thousand, six hundred and twenty-ninth

Scientific notation6.4629 × 10^4

Engineering notation64.629 × 10^3

In other bases

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

Quinary4032004base 5; one hand: 7 digits

Septenary356265base 7: 6 digits

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

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

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

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

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

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

Bit-level

1111110001110101

Bit length16 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits5within that length

Bit parityodd11 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

Bytes2fc 75

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

At each machine width

16-bit1111110001110101

32-bit00000000000000001111110001110101

64-bit0000000000000000000000000000000000000000000000001111110001110101

One's complement0000001110001010at 16 bits, every bit flipped

Bits reversed1010111000111111at 16 bits

Rotated left by 11111100011101011at 16 bits, wrapping

Shifted left by 111111100011101010= 129,258, no wrap

Shifted right by 1111111000111010= 32,314, discarding the low bit

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

Nearest landmarks

Next prime64,633+4

Previous prime64,627−2

Distance to nearest prime2

Nearest square below64,516

Nearest square above65,025

Powers & multiples

64,629 to the power 24,176,907,641

64,629 to the power 3269,949,363,930,189

64,629 to the power 417,446,557,441,444,184,881

64,629 to the power 51,127,553,560,883,096,224,674,149

First ten multiples64,629, 129,258, 193,887, 258,516, 323,145, 387,774, 452,403, 517,032, 581,661, 646,290

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 5No, remainder 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 5

Divisible by 9Yes

Divisible by 10No, remainder 9

Divisible by 11No, remainder 4

Divisible by 12No, remainder 9

Divisible by 100No, remainder 29

Collatz (3n + 1) trajectory

Steps to reach 1148the total stopping time

Highest value reached193,8883× the starting value

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

First steps64,629 → 193,888 → 96,944 → 48,472 → 24,236 → 12,118 → 6,059 → 18,178 → 9,089 → 27,268 → …

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

As a percentage & fraction

As a percentage6,462,900%

64,629% as a decimal646.29

64,629% of 10064,629

64,629% of 1,000646,290

As a fraction of 10064,629/100

Read another way

As seconds17 hours, 57 minutes and 9 seconds

As bytes63.114 KiB

As a 24-bit colour#00FC75

Keep nerding

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