Nerdulator> put something in

Recognised as Number

1,222,628

  • Positive
  • Even
  • Composite
  • 7 digits

1,222,628 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,222,628
Digit count7
Digit sum23
Digit product768
Multiplicative persistence5times 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^2 × 11 × 37 × 751
Distinct prime factors42, 11, 37, 751
Number of divisors24
Sum of divisors σ(n)2,400,384
Aliquot sum1,177,756sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)540,000integers below n that share no factor with it
Carmichael function λ(n)4,500the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 540,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 11, 22, 37, 44, 74, 148, 407, 751, 814, 1,502, 1,628, 3,004, 8,261, 16,522, 27,787, 33,044, 55,574, 111,148, 305,657, 611,314, 1,222,62824 in total

Arithmetic

Previous number1,222,627
Next number1,222,629
Double2,445,256
Cube1,827,607,841,115,417,152
Square root1,105.725101461≈irrational, shown to 9 decimal places
Cube root106.929641928≈
Negation-1,222,628
Reciprocal8.17910272 × 10^-7≈

Representations

Decimal1,222,628
Binary10010101001111110010021 bits
Octal4523744
Hexadecimal12A7E4
Base 36Q7DW
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and twenty-two thousand, six hundred and twenty-eight
Ordinalone million, two hundred and twenty-two thousand, six hundred and twenty-eighth
Scientific notation1.222628 × 10^6
Engineering notation1.222628 × 10^6

In other bases

Ternary2022010010112base 3; the most digit-efficient integer base after e: 13 digits
Quinary303111003base 5; one hand: 9 digits
Septenary13251341base 7: 8 digits
Nonary2263115base 9; each digit is two ternary digits: 7 digits
Duodecimal4ab658base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7cgb8base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:39:37:8base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10T010011TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101111111100000100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000100101010011111100100
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes312 a7 e4
Gray code110111111010000010110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000100101010011111100100
64-bit0000000000000000000000000000000000000000000100101010011111100100
One's complement11111111111011010101100000011011at 32 bits, every bit flipped
Bits reversed00100111111001010100100000000000at 32 bits
Rotated left by 100000000001001010100111111001000at 32 bits, wrapping
Shifted left by 11001010100111111001000= 2,445,256, no wrap
Shifted right by 110010101001111110010= 611,314, discarding the low bit
These bits as a double6.04058492 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,222,633+5
Previous prime1,222,603−25
Distance to nearest prime5
Nearest square below1,221,025
Nearest square above1,223,236

Powers & multiples

1,222,628 to the power 21,494,819,226,384
1,222,628 to the power 31,827,607,841,115,417,152
1,222,628 to the power 42,234,484,519,567,260,241,715,456
1,222,628 to the power 52,731,943,339,189,480,254,808,084,538,368
First ten multiples1,222,628, 2,445,256, 3,667,884, 4,890,512, 6,113,140, 7,335,768, 8,558,396, 9,781,024, 11,003,652, 12,226,280
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1142the total stopping time
Highest value reached1,222,628
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,222,628 → 611,314 → 305,657 → 916,972 → 458,486 → 229,243 → 687,730 → 343,865 → 1,031,596 → 515,798 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage122,262,800%
1,222,628% as a decimal12,226.28
1,222,628% of 1001,222,628
1,222,628% of 1,00012,226,280
As a fraction of 1001,222,628/100

Read another way

As bytes1.166 MiB
As a 24-bit colour#12A7E4

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