Recognised as Number

67,475

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value67,475

Digit count5

Digit sum29

Digit product5,880

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5^2 × 2,699

Distinct prime factors25, 2,699

Number of divisors6

Sum of divisors σ(n)83,700

Aliquot sum16,225sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 5, 25, 2,699, 13,495, 67,4756 in total

Arithmetic

Previous number67,474

Next number67,476

Double134,950

Half33,737.5

Square4,552,875,625

Cube307,205,282,796,875

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

Cube root40.711236929≈

Negation-67,475

Reciprocal0.0000148203≈

Representations

Decimal67,475

Binary1000001111001001117 bits

Octal203623

Hexadecimal10793

Base 361G2B

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

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

Ordinalsixty-seven thousand, four hundred and seventy-fifth

Scientific notation6.7475 × 10^4

Engineering notation67.475 × 10^3

In other bases

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

Quinary4124400base 5; one hand: 7 digits

Septenary400502base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010000011110010011

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 93

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

At each machine width

32-bit00000000000000010000011110010011

64-bit0000000000000000000000000000000000000000000000010000011110010011

One's complement11111111111111101111100001101100at 32 bits, every bit flipped

Bits reversed11001001111000001000000000000000at 32 bits

Rotated left by 100000000000000100000111100100110at 32 bits, wrapping

Shifted left by 1100000111100100110= 134,950, no wrap

Shifted right by 11000001111001001= 33,737, discarding the low bit

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

Nearest landmarks

Next prime67,477+2

Previous prime67,453−22

Distance to nearest prime2

Nearest square below67,081

Nearest square above67,600

Powers & multiples

67,475 to the power 24,552,875,625

67,475 to the power 3307,205,282,796,875

67,475 to the power 420,728,676,456,719,140,625

67,475 to the power 51,398,667,443,917,124,013,671,875

First ten multiples67,475, 134,950, 202,425, 269,900, 337,375, 404,850, 472,325, 539,800, 607,275, 674,750

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 3

Divisible by 5Yes

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 3

Divisible by 9No, remainder 2

Divisible by 10No, remainder 5

Divisible by 11No, remainder 1

Divisible by 12No, remainder 11

Divisible by 100No, remainder 75

Collatz (3n + 1) trajectory

Steps to reach 168the total stopping time

Highest value reached303,6404× the starting value

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

First steps67,475 → 202,426 → 101,213 → 303,640 → 151,820 → 75,910 → 37,955 → 113,866 → 56,933 → 170,800 → …

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

As a percentage & fraction

As a percentage6,747,500%

67,475% as a decimal674.75

67,475% of 10067,475

67,475% of 1,000674,750

As a fraction of 10067,475/100

Read another way

As seconds18 hours, 44 minutes and 35 seconds

As bytes65.894 KiB

As a 24-bit colour#010793

Keep nerding

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