Recognised as Number

61,072

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value61,072

Digit count5

Digit sum16

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2^4 × 11 × 347

Distinct prime factors32, 11, 347

Number of divisors20

Sum of divisors σ(n)129,456

Aliquot sum68,384sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 11, 16, 22, 44, 88, 176, 347, 694, 1,388, 2,776, 3,817, 5,552, 7,634, 15,268, 30,536, 61,07220 in total

Arithmetic

Previous number61,071

Next number61,073

Double122,144

Half30,536

Square3,729,789,184

Cube227,785,685,045,248

Square root247.127497458≈irrational, shown to 9 decimal places

Cube root39.380453599≈

Negation-61,072

Reciprocal0.0000163741≈

Representations

Decimal61,072

Binary111011101001000016 bits

Octal167220

HexadecimalEE90

Base 361B4G

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

In wordssixty-one thousand and seventy-two

Ordinalsixty-one thousand and seventy-second

Scientific notation6.1072 × 10^4

Engineering notation61.072 × 10^3

In other bases

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

Quinary3423242base 5; one hand: 7 digits

Septenary343024base 7: 6 digits

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

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

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

Sexagesimal16:57:52base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1110111010010000

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

Bit parityeven8 set bits, so even; not the same as the number itself being even

Highest set bitbit 15worth 32,768

Lowest set bitbit 44 trailing zeros

Power of twoNo

Bytes2ee 90

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

At each machine width

16-bit1110111010010000

32-bit00000000000000001110111010010000

64-bit0000000000000000000000000000000000000000000000001110111010010000

One's complement0001000101101111at 16 bits, every bit flipped

Bits reversed0000100101110111at 16 bits

Rotated left by 11101110100100001at 16 bits, wrapping

Shifted left by 111101110100100000= 122,144, no wrap

Shifted right by 1111011101001000= 30,536, discarding the low bit

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

Nearest landmarks

Next prime61,091+19

Previous prime61,057−15

Distance to nearest prime15

Nearest square below61,009

Nearest square above61,504

Powers & multiples

61,072 to the power 23,729,789,184

61,072 to the power 3227,785,685,045,248

61,072 to the power 413,911,327,357,083,385,856

61,072 to the power 5849,592,584,351,796,540,997,632

First ten multiples61,072, 122,144, 183,216, 244,288, 305,360, 366,432, 427,504, 488,576, 549,648, 610,720

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5No, remainder 2

Divisible by 6No, remainder 4

Divisible by 7No, remainder 4

Divisible by 8Yes

Divisible by 9No, remainder 7

Divisible by 10No, remainder 2

Divisible by 11Yes

Divisible by 12No, remainder 4

Divisible by 100No, remainder 72

Collatz (3n + 1) trajectory

Steps to reach 186the total stopping time

Highest value reached61,072

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

First steps61,072 → 30,536 → 15,268 → 7,634 → 3,817 → 11,452 → 5,726 → 2,863 → 8,590 → 4,295 → …

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

As a percentage & fraction

As a percentage6,107,200%

61,072% as a decimal610.72

61,072% of 10061,072

61,072% of 1,000610,720

As a fraction of 10061,072/100

Read another way

As seconds16 hours, 57 minutes and 52 seconds

As bytes59.641 KiB

As a 24-bit colour#00EE90

Keep nerding

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