Nerdulator> put something in

Number

61,112

  • Positive
  • Even
  • Composite
  • 5 digits

61,112 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value61,112
Digit count5
Digit sum11
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 7,639
Distinct prime factors22, 7,639
Number of divisors8
Sum of divisors σ(n)114,600
Aliquot sum53,488sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)30,552integers below n that share no factor with it
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 7,639, 15,278, 30,556, 61,1128 in total

Arithmetic

Previous number61,111
Next number61,113
Double122,224
Half30,556
Square root247.208414096irrational, shown to 9 decimal places
Cube root39.389049324
Negation-61,112
Reciprocal0.0000163634

Representations

Decimal61,112
Binary111011101011100016 bits
Octal167270
HexadecimalEEB8
Base 361B5K
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-one thousand, one hundred and twelve
Ordinalsixty-one thousand, one hundred and twelfth
Scientific notation6.1112 × 10^4
Engineering notation61.112 × 10^3

Nearest landmarks

Next prime61,121+9
Previous prime61,099−13
Distance to nearest prime9
Nearest square below61,009
Nearest square above61,504

Powers & multiples

61,112 to the power 23,734,676,544
61,112 to the power 3228,233,552,956,928
61,112 to the power 413,947,808,888,303,783,936
61,112 to the power 5852,378,496,782,020,843,896,832
First ten multiples61,112, 122,224, 183,336, 244,448, 305,560, 366,672, 427,784, 488,896, 550,008, 611,120
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

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 2
Divisible by 8Yes
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 7
Divisible by 12No, remainder 8
Divisible by 100No, remainder 12

Collatz (3n + 1) trajectory

Steps to reach 134the total stopping time
Highest value reached61,112
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps61,112 → 30,556 → 15,278 → 7,639 → 22,918 → 11,459 → 34,378 → 17,189 → 51,568 → 25,784 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,111,200%
61,112% as a decimal611.12
61,112% of 10061,112
61,112% of 1,000611,120
As a fraction of 10061,112/100

Read another way

As bytes59.68 KiB
As a 24-bit colour#00EEB8

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 “61112” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.