Recognised as Number
1,097,792
- Positive
- Even
- Composite
- 7 digits
1,097,792 is an even 7-digit integer and a composite number. It has 28 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,097,792
Digit count7
Digit sum35
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^6 × 17 × 1,009
Distinct prime factors32, 17, 1,009
Number of divisors28
Sum of divisors σ(n)2,308,860
Aliquot sum1,211,068sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)516,096integers below n that share no factor with it
Carmichael function λ(n)1,008the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 516,096
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 17, 32, 34, 64, 68, 136, 272, 544, 1,009, 1,088, 2,018, 4,036, 8,072, 16,144, 17,153, 32,288, 34,306, 64,576, 68,612, 137,224, 274,448, 548,896, 1,097,79228 in total
Arithmetic
Previous number1,097,791
Next number1,097,793
Double2,195,584
Half548,896
Square1,205,147,275,264
Cube1,323,001,037,606,617,088
Square root1,047.755696716≈irrational, shown to 9 decimal places
Cube root103.158896357≈
Negation-1,097,792
Reciprocal9.10919373 × 10^-7≈
Representations
Decimal1,097,792
Binary10000110000000100000021 bits
Octal4140100
Hexadecimal10C040
Base 36NJ28
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, ninety-seven thousand, seven hundred and ninety-two
Ordinalone million, ninety-seven thousand, seven hundred and ninety-second
Scientific notation1.097792 × 10^6
Engineering notation1.097792 × 10^6
In other bases
Ternary2001202212222base 3; the most digit-efficient integer base after e: 13 digits
Quinary240112132base 5; one hand: 9 digits
Septenary12221363base 7: 8 digits
Nonary2052788base 9; each digit is two ternary digits: 7 digits
Duodecimal44b368base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6h49cbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:4:56:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01TT100T000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011100000001000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100001100000001000000
Bit length21 bitsto write the magnitude
Set bits4the population count, or Hamming weight
Zero bits17within that length
Bit parityeven4 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 66 trailing zeros
Power of twoNo
Bytes310 c0 40
Gray code110001010000001100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100001100000001000000
64-bit0000000000000000000000000000000000000000000100001100000001000000
One's complement11111111111011110011111110111111at 32 bits, every bit flipped
Bits reversed00000010000000110000100000000000at 32 bits
Rotated left by 100000000001000011000000010000000at 32 bits, wrapping
Shifted left by 11000011000000010000000= 2,195,584, no wrap
Shifted right by 110000110000000100000= 548,896, discarding the low bit
These bits as a double5.42381313 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,097,792 to the power 21,205,147,275,264
1,097,792 to the power 31,323,001,037,606,617,088
1,097,792 to the power 41,452,379,955,076,243,386,269,696
1,097,792 to the power 51,594,411,095,643,059,379,499,782,111,232
First ten multiples1,097,792, 2,195,584, 3,293,376, 4,391,168, 5,488,960, 6,586,752, 7,684,544, 8,782,336, 9,880,128, 10,977,920
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 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 3
Divisible by 8Yes
Divisible by 9No, remainder 8
Divisible by 10No, remainder 2
Divisible by 11No, remainder 3
Divisible by 12No, remainder 8
Divisible by 100No, remainder 92
Collatz (3n + 1) trajectory
Steps to reach 172the total stopping time
Highest value reached1,097,792
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,097,792 → 548,896 → 274,448 → 137,224 → 68,612 → 34,306 → 17,153 → 51,460 → 25,730 → 12,865 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage109,779,200%
1,097,792% as a decimal10,977.92
1,097,792% of 1001,097,792
1,097,792% of 1,00010,977,920
As a fraction of 1001,097,792/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 1,097,792
Nerdulate something else
Nothing in mind? Surprise me · today’s page