Recognised as Number
1,136,698
- Positive
- Even
- Composite
- 7 digits
1,136,698 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,136,698
Digit count7
Digit sum34
Digit product7,776
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 568,349
Distinct prime factors22, 568,349
Number of divisors4
Sum of divisors σ(n)1,705,050
Aliquot sum568,352sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)568,348integers below n that share no factor with it
Carmichael function λ(n)568,348the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 568,349, 1,136,6984 in total
Arithmetic
Previous number1,136,697
Next number1,136,699
Double2,273,396
Half568,349
Square1,292,082,343,204
Cube1,468,707,415,355,300,392
Square root1,066.16040069≈irrational, shown to 9 decimal places
Cube root104.363435079≈
Negation-1,136,698
Reciprocal8.79741145 × 10^-7≈
Representations
Decimal1,136,698
Binary10001010110000011101021 bits
Octal4254072
Hexadecimal11583A
Base 36OD2Y
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and thirty-six thousand, six hundred and ninety-eight
Ordinalone million, one hundred and thirty-six thousand, six hundred and ninety-eighth
Scientific notation1.136698 × 10^6
Engineering notation1.136698 × 10^6
In other bases
Ternary2010202020221base 3; the most digit-efficient integer base after e: 13 digits
Quinary242333243base 5; one hand: 9 digits
Septenary12442663base 7: 8 digits
Nonary2122227base 9; each digit is two ternary digits: 7 digits
Duodecimal46998abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal721eibase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:15:44:58base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T011T1T1T10T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101010100001001110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010101100000111010
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; 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
Bytes311 58 3a
Gray code110011111010000100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010101100000111010
64-bit0000000000000000000000000000000000000000000100010101100000111010
One's complement11111111111011101010011111000101at 32 bits, every bit flipped
Bits reversed01011100000110101000100000000000at 32 bits
Rotated left by 100000000001000101011000001110100at 32 bits, wrapping
Shifted left by 11000101011000001110100= 2,273,396, no wrap
Shifted right by 110001010110000011101= 568,349, discarding the low bit
These bits as a double5.61603431 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,136,698 to the power 21,292,082,343,204
1,136,698 to the power 31,468,707,415,355,300,392
1,136,698 to the power 41,669,476,781,619,539,244,985,616
1,136,698 to the power 51,897,690,918,713,367,020,696,659,735,968
First ten multiples1,136,698, 2,273,396, 3,410,094, 4,546,792, 5,683,490, 6,820,188, 7,956,886, 9,093,584, 10,230,282, 11,366,980
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9No, remainder 7
Divisible by 10No, remainder 8
Divisible by 11No, remainder 2
Divisible by 12No, remainder 10
Divisible by 100No, remainder 98
Collatz (3n + 1) trajectory
Steps to reach 177the total stopping time
Highest value reached1,705,0481× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,136,698 → 568,349 → 1,705,048 → 852,524 → 426,262 → 213,131 → 639,394 → 319,697 → 959,092 → 479,546 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage113,669,800%
1,136,698% as a decimal11,366.98
1,136,698% of 1001,136,698
1,136,698% of 1,00011,366,980
As a fraction of 1001,136,698/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,136,698
Nerdulate something else
Nothing in mind? Surprise me · today’s page