Recognised as Number
1,080,175
- Positive
- Odd
- Composite
- 7 digits
1,080,175 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,080,175
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5^2 × 43,207
Distinct prime factors25, 43,207
Number of divisors6
Sum of divisors σ(n)1,339,448
Aliquot sum259,273sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)864,120integers below n that share no factor with it
Carmichael function λ(n)432,060the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 864,120
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 5, 25, 43,207, 216,035, 1,080,1756 in total
Arithmetic
Previous number1,080,174
Next number1,080,176
Double2,160,350
Half540,087.5
Square1,166,778,030,625
Cube1,260,324,459,230,359,375
Square root1,039.314678045≈irrational, shown to 9 decimal places
Cube root102.60409809≈
Negation-1,080,175
Reciprocal9.25775916 × 10^-7≈
Representations
Decimal1,080,175
Binary10000011110110110111121 bits
Octal4075557
Hexadecimal107B6F
Base 36N5GV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, eighty thousand, one hundred and seventy-five
Ordinalone million, eighty thousand, one hundred and seventy-fifth
Scientific notation1.080175 × 10^6
Engineering notation1.080175 × 10^6
In other bases
Ternary2000212201111base 3; the most digit-efficient integer base after e: 13 digits
Quinary234031200base 5; one hand: 9 digits
Septenary12116125base 7: 8 digits
Nonary2025644base 9; each digit is two ternary digits: 7 digits
Duodecimal441127base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6f08fbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:0:2:55base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0010T0T01111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011000110010110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000111101101101111
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 set bits, so odd; 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
Bytes310 7b 6f
Gray code110000100011011011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000111101101101111
64-bit0000000000000000000000000000000000000000000100000111101101101111
One's complement11111111111011111000010010010000at 32 bits, every bit flipped
Bits reversed11110110110111100000100000000000at 32 bits
Rotated left by 100000000001000001111011011011110at 32 bits, wrapping
Shifted left by 11000001111011011011110= 2,160,350, no wrap
Shifted right by 110000011110110110111= 540,087, discarding the low bit
These bits as a double5.33677359 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,080,175 to the power 21,166,778,030,625
1,080,175 to the power 31,260,324,459,230,359,375
1,080,175 to the power 41,361,370,972,749,153,437,890,625
1,080,175 to the power 51,470,518,890,489,316,814,773,505,859,375
First ten multiples1,080,175, 2,160,350, 3,240,525, 4,320,700, 5,400,875, 6,481,050, 7,561,225, 8,641,400, 9,721,575, 10,801,750
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 5
Divisible by 11No, remainder 8
Divisible by 12No, remainder 7
Divisible by 100No, remainder 75
Collatz (3n + 1) trajectory
Steps to reach 1134the total stopping time
Highest value reached12,303,88011× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,080,175 → 3,240,526 → 1,620,263 → 4,860,790 → 2,430,395 → 7,291,186 → 3,645,593 → 10,936,780 → 5,468,390 → 2,734,195 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage108,017,500%
1,080,175% as a decimal10,801.75
1,080,175% of 1001,080,175
1,080,175% of 1,00010,801,750
As a fraction of 1001,080,175/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,080,175
Nerdulate something else
Nothing in mind? Surprise me · today’s page