Recognised as Number
2,228,112
- Positive
- Even
- Composite
- 7 digits
2,228,112 is an even 7-digit integer and a composite number. It has 30 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,228,112
Digit count7
Digit sum18
Digit product128
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^4 × 3^2 × 15,473
Distinct prime factors32, 3, 15,473
Number of divisors30
Sum of divisors σ(n)6,236,022
Aliquot sum4,007,910sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)742,656integers below n that share no factor with it
Carmichael function λ(n)46,416the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 742,656
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 36, 48, 72, 144, 15,473, 30,946, 46,419, 61,892, 92,838, 123,784, 139,257, 185,676, 247,568, 278,514, 371,352, 557,028, 742,704, 1,114,056, 2,228,11230 in total
Arithmetic
Previous number2,228,111
Next number2,228,113
Double4,456,224
Half1,114,056
Square4,964,483,084,544
Cube11,061,424,334,469,500,928
Square root1,492.686169293≈irrational, shown to 9 decimal places
Cube root130.610774837≈
Negation-2,228,112
Reciprocal4.48810473 × 10^-7≈
Representations
Decimal2,228,112
Binary100001111111111001000022 bits
Octal10377620
Hexadecimal21FF90
Base 361BR80
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and twenty-eight thousand, one hundred and twelve
Ordinaltwo million, two hundred and twenty-eight thousand, one hundred and twelfth
Scientific notation2.228112 × 10^6
Engineering notation2.228112 × 10^6
In other bases
Ternary11012012101200base 3; the most digit-efficient integer base after e: 14 digits
Quinary1032244422base 5; one hand: 10 digits
Septenary24636645base 7: 8 digits
Nonary4165350base 9; each digit is two ternary digits: 7 digits
Duodecimal8b5500base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldia5cbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:18:55:12base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111TT1TT11TT00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001100000000010010000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000011111111110010000
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes321 ff 90
Gray code1100010000000001011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000011111111110010000
64-bit0000000000000000000000000000000000000000001000011111111110010000
One's complement11111111110111100000000001101111at 32 bits, every bit flipped
Bits reversed00001001111111111000010000000000at 32 bits
Rotated left by 100000000010000111111111100100000at 32 bits, wrapping
Shifted left by 110000111111111100100000= 4,456,224, no wrap
Shifted right by 1100001111111111001000= 1,114,056, discarding the low bit
These bits as a double1.10083359 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,228,112 to the power 24,964,483,084,544
2,228,112 to the power 311,061,424,334,469,500,928
2,228,112 to the power 424,646,092,296,723,508,651,687,936
2,228,112 to the power 554,914,253,999,437,210,308,929,710,456,832
First ten multiples2,228,112, 4,456,224, 6,684,336, 8,912,448, 11,140,560, 13,368,672, 15,596,784, 17,824,896, 20,053,008, 22,281,120
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 5
Divisible by 8Yes
Divisible by 9Yes
Divisible by 10No, remainder 2
Divisible by 11No, remainder 7
Divisible by 12Yes
Divisible by 100No, remainder 12
Collatz (3n + 1) trajectory
Steps to reach 1179the total stopping time
Highest value reached2,228,112
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,228,112 → 1,114,056 → 557,028 → 278,514 → 139,257 → 417,772 → 208,886 → 104,443 → 313,330 → 156,665 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage222,811,200%
2,228,112% as a decimal22,281.12
2,228,112% of 1002,228,112
2,228,112% of 1,00022,281,120
As a fraction of 1002,228,112/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 2,228,112
Nerdulate something else
Nothing in mind? Surprise me · today’s page