Recognised as Number
67,769
- Positive
- Odd
- Composite
- 5 digits
67,769 is an odd 5-digit integer and a composite number. It has 6 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value67,769
Digit count5
Digit sum35
Digit product15,876
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation13^2 × 401
Distinct prime factors213, 401
Number of divisors6
Sum of divisors σ(n)73,566
Aliquot sum5,797sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)62,400integers below n that share no factor with it
Carmichael function λ(n)15,600the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 62,400
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 13, 169, 401, 5,213, 67,7696 in total
Arithmetic
Representations
Decimal67,769
Binary1000010001011100117 bits
Octal204271
Hexadecimal108B9
Base 361GAH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-seven thousand, seven hundred and sixty-nine
Ordinalsixty-seven thousand, seven hundred and sixty-ninth
Scientific notation6.7769 × 10^4
Engineering notation67.769 × 10^3
In other bases
Ternary10102221222base 3; the most digit-efficient integer base after e: 11 digits
Quinary4132034base 5; one hand: 7 digits
Septenary401402base 7: 6 digits
Nonary112858base 9; each digit is two ternary digits: 6 digits
Duodecimal33275base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal8989base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:49:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1011000T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001100111001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010000100010111001
Bit length17 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits10within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 08 b9
Gray code11000110011100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010000100010111001
64-bit0000000000000000000000000000000000000000000000010000100010111001
One's complement11111111111111101111011101000110at 32 bits, every bit flipped
Bits reversed10011101000100001000000000000000at 32 bits
Rotated left by 100000000000000100001000101110010at 32 bits, wrapping
Shifted left by 1100001000101110010= 135,538, no wrap
Shifted right by 11000010001011100= 33,884, discarding the low bit
These bits as a double3.34823348 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
67,769 to the power 24,592,637,361
67,769 to the power 3311,238,441,317,609
67,769 to the power 421,092,317,929,653,044,321
67,769 to the power 51,429,405,293,774,657,160,589,849
First ten multiples67,769, 135,538, 203,307, 271,076, 338,845, 406,614, 474,383, 542,152, 609,921, 677,690
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 69
Collatz (3n + 1) trajectory
Steps to reach 1112the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps67,769 → 203,308 → 101,654 → 50,827 → 152,482 → 76,241 → 228,724 → 114,362 → 57,181 → 171,544 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage6,776,900%
67,769% as a decimal677.69
67,769% of 10067,769
67,769% of 1,000677,690
As a fraction of 10067,769/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 67,769
Nerdulate something else
Nothing in mind? Surprise me · today’s page