Nerdulator> put something in

Recognised as Number

1,099,746

  • Positive
  • Even
  • Composite
  • 7 digits

1,099,746 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,099,746
Digit count7
Digit sum36
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3^2 × 107 × 571
Distinct prime factors42, 3, 107, 571
Number of divisors24
Sum of divisors σ(n)2,409,264
Aliquot sum1,309,518sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)362,520integers below n that share no factor with it
Carmichael function λ(n)30,210the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 362,520
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 18, 107, 214, 321, 571, 642, 963, 1,142, 1,713, 1,926, 3,426, 5,139, 10,278, 61,097, 122,194, 183,291, 366,582, 549,873, 1,099,74624 in total

Arithmetic

Previous number1,099,745
Next number1,099,747
Double2,199,492
Cube1,330,078,192,886,412,936
Square root1,048.68775143≈irrational, shown to 9 decimal places
Cube root103.220065505≈
Negation-1,099,746
Reciprocal9.09300875 × 10^-7≈

Representations

Decimal1,099,746
Binary10000110001111110001021 bits
Octal4143742
Hexadecimal10C7E2
Base 36NKKI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, ninety-nine thousand, seven hundred and forty-six
Ordinalone million, ninety-nine thousand, seven hundred and forty-sixth
Scientific notation1.099746 × 10^6
Engineering notation1.099746 × 10^6

In other bases

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

Bit-level

00000000000100001100011111100010
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes310 c7 e2
Gray code110001010010000010011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000100001100011111100010
64-bit0000000000000000000000000000000000000000000100001100011111100010
One's complement11111111111011110011100000011101at 32 bits, every bit flipped
Bits reversed01000111111000110000100000000000at 32 bits
Rotated left by 100000000001000011000111111000100at 32 bits, wrapping
Shifted left by 11000011000111111000100= 2,199,492, no wrap
Shifted right by 110000110001111110001= 549,873, discarding the low bit
These bits as a double5.43346718 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,099,757+11
Previous prime1,099,741−5
Distance to nearest prime5
Nearest square below1,098,304
Nearest square above1,100,401

Powers & multiples

1,099,746 to the power 21,209,441,264,516
1,099,746 to the power 31,330,078,192,886,412,936
1,099,746 to the power 41,462,748,172,314,061,080,714,256
1,099,746 to the power 51,608,651,451,509,699,417,271,180,178,976
First ten multiples1,099,746, 2,199,492, 3,299,238, 4,398,984, 5,498,730, 6,598,476, 7,698,222, 8,797,968, 9,897,714, 10,997,460
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1147the total stopping time
Highest value reached1,649,6201× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,099,746 → 549,873 → 1,649,620 → 824,810 → 412,405 → 1,237,216 → 618,608 → 309,304 → 154,652 → 77,326 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage109,974,600%
1,099,746% as a decimal10,997.46
1,099,746% of 1001,099,746
1,099,746% of 1,00010,997,460
As a fraction of 1001,099,746/100

Read another way

As bytes1.049 MiB
As a 24-bit colour#10C7E2

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