Recognised as Number
1,135,695
- Positive
- Odd
- Composite
- 7 digits
1,135,695 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,135,695
Digit count7
Digit sum30
Digit product4,050
Multiplicative persistence2times 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 × 5 × 11 × 6,883
Distinct prime factors43, 5, 11, 6,883
Number of divisors16
Sum of divisors σ(n)1,982,592
Aliquot sum846,897sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)550,560integers below n that share no factor with it
Carmichael function λ(n)68,820the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 550,560
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 11, 15, 33, 55, 165, 6,883, 20,649, 34,415, 75,713, 103,245, 227,139, 378,565, 1,135,69516 in total
Arithmetic
Previous number1,135,694
Next number1,135,696
Double2,271,390
Half567,847.5
Square1,289,803,133,025
Cube1,464,822,969,160,827,375
Square root1,065.689917377≈irrational, shown to 9 decimal places
Cube root104.332729964≈
Negation-1,135,695
Reciprocal8.80518097 × 10^-7≈
Representations
Decimal1,135,695
Binary10001010101000100111121 bits
Octal4252117
Hexadecimal11544F
Base 36OCB3
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and thirty-five thousand, six hundred and ninety-five
Ordinalone million, one hundred and thirty-five thousand, six hundred and ninety-fifth
Scientific notation1.135695 × 10^6
Engineering notation1.135695 × 10^6
In other bases
Ternary2010200212210base 3; the most digit-efficient integer base after e: 13 digits
Quinary242320240base 5; one hand: 9 digits
Septenary12440031base 7: 8 digits
Nonary2120783base 9; each digit is two ternary digits: 7 digits
Duodecimal469293base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal71j4fbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:15:28:15base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T011T010T0T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010101010001010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010101010001001111
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes311 54 4f
Gray code110011111111001101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010101010001001111
64-bit0000000000000000000000000000000000000000000100010101010001001111
One's complement11111111111011101010101110110000at 32 bits, every bit flipped
Bits reversed11110010001010101000100000000000at 32 bits
Rotated left by 100000000001000101010100010011110at 32 bits, wrapping
Shifted left by 11000101010100010011110= 2,271,390, no wrap
Shifted right by 110001010101000100111= 567,847, discarding the low bit
These bits as a double5.61107884 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,135,695 to the power 21,289,803,133,025
1,135,695 to the power 31,464,822,969,160,827,375
1,135,695 to the power 41,663,592,121,961,105,845,650,625
1,135,695 to the power 51,889,333,254,950,618,103,376,186,559,375
First ten multiples1,135,695, 2,271,390, 3,407,085, 4,542,780, 5,678,475, 6,814,170, 7,949,865, 9,085,560, 10,221,255, 11,356,950
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 5
Divisible by 11Yes
Divisible by 12No, remainder 3
Divisible by 100No, remainder 95
Collatz (3n + 1) trajectory
Steps to reach 185the total stopping time
Highest value reached11,498,92010× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,135,695 → 3,407,086 → 1,703,543 → 5,110,630 → 2,555,315 → 7,665,946 → 3,832,973 → 11,498,920 → 5,749,460 → 2,874,730 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage113,569,500%
1,135,695% as a decimal11,356.95
1,135,695% of 1001,135,695
1,135,695% of 1,00011,356,950
As a fraction of 1001,135,695/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,135,695
Nerdulate something else
Nothing in mind? Surprise me · today’s page