Recognised as Number

67,467

Positive
Odd
Composite
5 digits

67,467 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value67,467

Digit count5

Digit sum30

Digit product7,056

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 43 × 523

Distinct prime factors33, 43, 523

Number of divisors8

Sum of divisors σ(n)92,224

Aliquot sum24,757sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 43, 129, 523, 1,569, 22,489, 67,4678 in total

Arithmetic

Previous number67,466

Next number67,468

Double134,934

Half33,733.5

Square4,551,796,089

Cube307,096,026,736,563

Square root259.744104842≈irrational, shown to 9 decimal places

Cube root40.709627924≈

Negation-67,467

Reciprocal0.0000148221≈

Representations

Decimal67,467

Binary1000001111000101117 bits

Octal203613

Hexadecimal1078B

Base 361G23

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

In wordssixty-seven thousand, four hundred and sixty-seven

Ordinalsixty-seven thousand, four hundred and sixty-seventh

Scientific notation6.7467 × 10^4

Engineering notation67.467 × 10^3

In other bases

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

Quinary4124332base 5; one hand: 7 digits

Septenary400461base 7: 6 digits

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

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

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

Sexagesimal18:44:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

00000000000000010000011110001011

Bit length17 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits9within that length

Bit parityeven8 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 07 8b

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

At each machine width

32-bit00000000000000010000011110001011

64-bit0000000000000000000000000000000000000000000000010000011110001011

One's complement11111111111111101111100001110100at 32 bits, every bit flipped

Bits reversed11010001111000001000000000000000at 32 bits

Rotated left by 100000000000000100000111100010110at 32 bits, wrapping

Shifted left by 1100000111100010110= 134,934, no wrap

Shifted right by 11000001111000101= 33,733, discarding the low bit

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

Nearest landmarks

Next prime67,477+10

Previous prime67,453−14

Distance to nearest prime10

Nearest square below67,081

Nearest square above67,600

Powers & multiples

67,467 to the power 24,551,796,089

67,467 to the power 3307,096,026,736,563

67,467 to the power 420,718,847,635,835,695,921

67,467 to the power 51,397,838,493,446,926,896,702,107

First ten multiples67,467, 134,934, 202,401, 269,868, 337,335, 404,802, 472,269, 539,736, 607,203, 674,670

Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 1

Divisible by 8No, remainder 3

Divisible by 9No, remainder 3

Divisible by 10No, remainder 7

Divisible by 11No, remainder 4

Divisible by 12No, remainder 3

Divisible by 100No, remainder 67

Collatz (3n + 1) trajectory

Steps to reach 160the total stopping time

Highest value reached303,6044× the starting value

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

First steps67,467 → 202,402 → 101,201 → 303,604 → 151,802 → 75,901 → 227,704 → 113,852 → 56,926 → 28,463 → …

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

As a percentage & fraction

As a percentage6,746,700%

67,467% as a decimal674.67

67,467% of 10067,467

67,467% of 1,000674,670

As a fraction of 10067,467/100

Read another way

As seconds18 hours, 44 minutes and 27 seconds

As bytes65.886 KiB

As a 24-bit colour#01078B

Keep nerding

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