Recognised as Number

67,477

Positive
Odd
Prime
5 digits

67,477 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value67,477

Digit count5

Digit sum31

Digit product8,232

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation67,477

Distinct prime factors167,477

Number of divisors2

Sum of divisors σ(n)67,478

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)67,476the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 67,4772 in total

Arithmetic

Previous number67,476

Next number67,478

Double134,954

Half33,738.5

Square4,553,145,529

Cube307,232,600,860,333

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

Cube root40.71163916≈

Negation-67,477

Reciprocal0.0000148199≈

Representations

Decimal67,477

Binary1000001111001010117 bits

Octal203625

Hexadecimal10795

Base 361G2D

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

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

Ordinalsixty-seven thousand, four hundred and seventy-seventh

Scientific notation6.7477 × 10^4

Engineering notation67.477 × 10^3

In other bases

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

Quinary4124402base 5; one hand: 7 digits

Septenary400504base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010000011110010101

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 95

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

At each machine width

32-bit00000000000000010000011110010101

64-bit0000000000000000000000000000000000000000000000010000011110010101

One's complement11111111111111101111100001101010at 32 bits, every bit flipped

Bits reversed10101001111000001000000000000000at 32 bits

Rotated left by 100000000000000100000111100101010at 32 bits, wrapping

Shifted left by 1100000111100101010= 134,954, no wrap

Shifted right by 11000001111001010= 33,738, discarding the low bit

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

Nearest landmarks

Next prime67,481+4

Previous prime67,453−24

Distance to nearest prime0, it is prime

Nearest square below67,081

Nearest square above67,600

Powers & multiples

67,477 to the power 24,553,145,529

67,477 to the power 3307,232,600,860,333

67,477 to the power 420,731,134,208,252,689,841

67,477 to the power 51,398,874,742,970,266,752,401,157

First ten multiples67,477, 134,954, 202,431, 269,908, 337,385, 404,862, 472,339, 539,816, 607,293, 674,770

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 5

Divisible by 9No, remainder 4

Divisible by 10No, remainder 7

Divisible by 11No, remainder 3

Divisible by 12No, remainder 1

Divisible by 100No, remainder 77

Collatz (3n + 1) trajectory

Steps to reach 160the total stopping time

Highest value reached202,4323× the starting value

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

First steps67,477 → 202,432 → 101,216 → 50,608 → 25,304 → 12,652 → 6,326 → 3,163 → 9,490 → 4,745 → …

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

As a percentage & fraction

As a percentage6,747,700%

67,477% as a decimal674.77

67,477% of 10067,477

67,477% of 1,000674,770

As a fraction of 10067,477/100

Read another way

As seconds18 hours, 44 minutes and 37 seconds

As bytes65.896 KiB

As a 24-bit colour#010795

Keep nerding

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