Nerdulator> put something in

Recognised as Number

68,072

  • Positive
  • Even
  • Composite
  • 5 digits

68,072 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value68,072
Digit count5
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2^3 × 67 × 127
Distinct prime factors32, 67, 127
Number of divisors16
Sum of divisors σ(n)130,560
Aliquot sum62,488sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)33,264integers below n that share no factor with it
Carmichael function λ(n)1,386the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 33,264
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 67, 127, 134, 254, 268, 508, 536, 1,016, 8,509, 17,018, 34,036, 68,07216 in total

Arithmetic

Previous number68,071
Next number68,073
Double136,144
Half34,036
Square root260.906113382≈irrational, shown to 9 decimal places
Cube root40.830951779≈
Negation-68,072
Reciprocal0.0000146903≈

Representations

Decimal68,072
Binary1000010011110100017 bits
Octal204750
Hexadecimal109E8
Base 361GIW
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-eight thousand and seventy-two
Ordinalsixty-eight thousand and seventy-second
Scientific notation6.8072 × 10^4
Engineering notation68.072 × 10^3

In other bases

Ternary10110101012base 3; the most digit-efficient integer base after e: 11 digits
Quinary4134242base 5; one hand: 7 digits
Septenary402314base 7: 6 digits
Nonary113335base 9; each digit is two ternary digits: 6 digits
Duodecimal33488base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal8a3cbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:54:32base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary101101011TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001111000111000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010000100111101000
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 even
Highest set bitbit 16worth 65,536
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes301 09 e8
Gray code11000110100011100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010000100111101000
64-bit0000000000000000000000000000000000000000000000010000100111101000
One's complement11111111111111101111011000010111at 32 bits, every bit flipped
Bits reversed00010111100100001000000000000000at 32 bits
Rotated left by 100000000000000100001001111010000at 32 bits, wrapping
Shifted left by 1100001001111010000= 136,144, no wrap
Shifted right by 11000010011110100= 34,036, discarding the low bit
These bits as a double3.36320366 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime68,087+15
Previous prime68,071−1
Distance to nearest prime1
Nearest square below67,600
Nearest square above68,121

Powers & multiples

68,072 to the power 24,633,797,184
68,072 to the power 3315,431,841,909,248
68,072 to the power 421,472,076,342,446,329,856
68,072 to the power 51,461,647,180,783,006,565,957,632
First ten multiples68,072, 136,144, 204,216, 272,288, 340,360, 408,432, 476,504, 544,576, 612,648, 680,720
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 4
Divisible by 8Yes
Divisible by 9No, remainder 5
Divisible by 10No, remainder 2
Divisible by 11No, remainder 4
Divisible by 12No, remainder 8
Divisible by 100No, remainder 72

Collatz (3n + 1) trajectory

Steps to reach 181the total stopping time
Highest value reached68,072
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps68,072 → 34,036 → 17,018 → 8,509 → 25,528 → 12,764 → 6,382 → 3,191 → 9,574 → 4,787 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,807,200%
68,072% as a decimal680.72
68,072% of 10068,072
68,072% of 1,000680,720
As a fraction of 10068,072/100

Read another way

As bytes66.477 KiB
As a 24-bit colour#0109E8

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “68072” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.