Recognised as Number
67,613
- Positive
- Odd
- Composite
- 5 digits
67,613 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value67,613
Digit count5
Digit sum23
Digit product756
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 13 × 743
Distinct prime factors37, 13, 743
Number of divisors8
Sum of divisors σ(n)83,328
Aliquot sum15,715sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)53,424integers below n that share no factor with it
Carmichael function λ(n)4,452the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 53,424
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 13, 91, 743, 5,201, 9,659, 67,6138 in total
Arithmetic
Representations
Decimal67,613
Binary1000010000001110117 bits
Octal204035
Hexadecimal1081D
Base 361G65
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-seven thousand, six hundred and thirteen
Ordinalsixty-seven thousand, six hundred and thirteenth
Scientific notation6.7613 × 10^4
Engineering notation67.613 × 10^3
In other bases
Ternary10102202012base 3; the most digit-efficient integer base after e: 11 digits
Quinary4130423base 5; one hand: 7 digits
Septenary401060base 7: 6 digits
Nonary112665base 9; each digit is two ternary digits: 6 digits
Duodecimal33165base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal890dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:46:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10110T1T1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001100001101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010000100000011101
Bit length17 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits11within that length
Bit parityeven6 set bits, so even; 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 1d
Gray code11000110000010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010000100000011101
64-bit0000000000000000000000000000000000000000000000010000100000011101
One's complement11111111111111101111011111100010at 32 bits, every bit flipped
Bits reversed10111000000100001000000000000000at 32 bits
Rotated left by 100000000000000100001000000111010at 32 bits, wrapping
Shifted left by 1100001000000111010= 135,226, no wrap
Shifted right by 11000010000001110= 33,806, discarding the low bit
These bits as a double3.34052605 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
67,613 to the power 24,571,517,769
67,613 to the power 3309,094,030,915,397
67,613 to the power 420,898,774,712,282,737,361
67,613 to the power 51,413,028,854,621,572,721,189,293
First ten multiples67,613, 135,226, 202,839, 270,452, 338,065, 405,678, 473,291, 540,904, 608,517, 676,130
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 3
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1205the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps67,613 → 202,840 → 101,420 → 50,710 → 25,355 → 76,066 → 38,033 → 114,100 → 57,050 → 28,525 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage6,761,300%
67,613% as a decimal676.13
67,613% of 10067,613
67,613% of 1,000676,130
As a fraction of 10067,613/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,613
Nerdulate something else
Nothing in mind? Surprise me · today’s page