Recognised as Number

67,155

Positive
Odd
Composite
5 digits

67,155 is an odd 5-digit integer and a composite number. It has 24 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value67,155

Digit count5

Digit sum24

Digit product1,050

Multiplicative persistence2times 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 numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 5 × 11^2 × 37

Distinct prime factors43, 5, 11, 37

Number of divisors24

Sum of divisors σ(n)121,296

Aliquot sum54,141sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,980the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 31,680

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 5, 11, 15, 33, 37, 55, 111, 121, 165, 185, 363, 407, 555, 605, 1,221, 1,815, 2,035, 4,477, 6,105, 13,431, 22,385, 67,15524 in total

Arithmetic

Previous number67,154

Next number67,156

Double134,310

Half33,577.5

Square4,509,794,025

Cube302,855,217,748,875

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

Cube root40.646777279≈

Negation-67,155

Reciprocal0.0000148909≈

Representations

Decimal67,155

Binary1000001100101001117 bits

Octal203123

Hexadecimal10653

Base 361FTF

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

In wordssixty-seven thousand, one hundred and fifty-five

Ordinalsixty-seven thousand, one hundred and fifty-fifth

Scientific notation6.7155 × 10^4

Engineering notation67.155 × 10^3

In other bases

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

Quinary4122110base 5; one hand: 7 digits

Septenary366534base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010000011001010011

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 06 53

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

At each machine width

32-bit00000000000000010000011001010011

64-bit0000000000000000000000000000000000000000000000010000011001010011

One's complement11111111111111101111100110101100at 32 bits, every bit flipped

Bits reversed11001010011000001000000000000000at 32 bits

Rotated left by 100000000000000100000110010100110at 32 bits, wrapping

Shifted left by 1100000110010100110= 134,310, no wrap

Shifted right by 11000001100101001= 33,577, discarding the low bit

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

Nearest landmarks

Next prime67,157+2

Previous prime67,153−2

Distance to nearest prime2

Nearest square below67,081

Nearest square above67,600

Powers & multiples

67,155 to the power 24,509,794,025

67,155 to the power 3302,855,217,748,875

67,155 to the power 420,338,242,147,925,700,625

67,155 to the power 51,365,814,651,443,950,425,471,875

First ten multiples67,155, 134,310, 201,465, 268,620, 335,775, 402,930, 470,085, 537,240, 604,395, 671,550

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 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 3

Divisible by 9No, remainder 6

Divisible by 10No, remainder 5

Divisible by 11Yes

Divisible by 12No, remainder 3

Divisible by 100No, remainder 55

Collatz (3n + 1) trajectory

Steps to reach 1236the total stopping time

Highest value reached6,810,136101× the starting value

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

First steps67,155 → 201,466 → 100,733 → 302,200 → 151,100 → 75,550 → 37,775 → 113,326 → 56,663 → 169,990 → …

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

As a percentage & fraction

As a percentage6,715,500%

67,155% as a decimal671.55

67,155% of 10067,155

67,155% of 1,000671,550

As a fraction of 10067,155/100

Read another way

As seconds18 hours, 39 minutes and 15 seconds

As bytes65.581 KiB

As a 24-bit colour#010653

Keep nerding

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