Recognised as Number
2,228,133
- Positive
- Odd
- Composite
- 7 digits
2,228,133 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,228,133
Digit count7
Digit sum21
Digit product576
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 742,711
Distinct prime factors23, 742,711
Number of divisors4
Sum of divisors σ(n)2,970,848
Aliquot sum742,715sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,485,420integers below n that share no factor with it
Carmichael function λ(n)742,710the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,485,420
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 742,711, 2,228,1334 in total
Arithmetic
Previous number2,228,132
Next number2,228,134
Double4,456,266
Half1,114,066.5
Square4,964,576,665,689
Cube11,061,737,099,851,628,637
Square root1,492.693203575≈irrational, shown to 9 decimal places
Cube root130.611185172≈
Negation-2,228,133
Reciprocal4.48806243 × 10^-7≈
Representations
Decimal2,228,133
Binary100001111111111010010122 bits
Octal10377645
Hexadecimal21FFA5
Base 361BR8L
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and twenty-eight thousand, one hundred and thirty-three
Ordinaltwo million, two hundred and twenty-eight thousand, one hundred and thirty-third
Scientific notation2.228133 × 10^6
Engineering notation2.228133 × 10^6
In other bases
Ternary11012012102110base 3; the most digit-efficient integer base after e: 14 digits
Quinary1032300013base 5; one hand: 10 digits
Septenary24640005base 7: 8 digits
Nonary4165373base 9; each digit is two ternary digits: 7 digits
Duodecimal8b5519base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldia6dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:18:55:33base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111TT1TT11T110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001100000000011100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000011111111110100101
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 set bits, so even; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes321 ff a5
Gray code1100010000000001110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000011111111110100101
64-bit0000000000000000000000000000000000000000001000011111111110100101
One's complement11111111110111100000000001011010at 32 bits, every bit flipped
Bits reversed10100101111111111000010000000000at 32 bits
Rotated left by 100000000010000111111111101001010at 32 bits, wrapping
Shifted left by 110000111111111101001010= 4,456,266, no wrap
Shifted right by 1100001111111111010010= 1,114,066, discarding the low bit
These bits as a double1.10084397 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,228,133 to the power 24,964,576,665,689
2,228,133 to the power 311,061,737,099,851,628,637
2,228,133 to the power 424,647,021,469,503,708,869,844,721
2,228,133 to the power 554,916,841,887,909,707,355,293,727,735,893
First ten multiples2,228,133, 4,456,266, 6,684,399, 8,912,532, 11,140,665, 13,368,798, 15,596,931, 17,825,064, 20,053,197, 22,281,330
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 9
Divisible by 100No, remainder 33
Collatz (3n + 1) trajectory
Steps to reach 186the total stopping time
Highest value reached7,138,0963× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,228,133 → 6,684,400 → 3,342,200 → 1,671,100 → 835,550 → 417,775 → 1,253,326 → 626,663 → 1,879,990 → 939,995 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage222,813,300%
2,228,133% as a decimal22,281.33
2,228,133% of 1002,228,133
2,228,133% of 1,00022,281,330
As a fraction of 1002,228,133/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,133
Nerdulate something else
Nothing in mind? Surprise me · today’s page