Recognised as Number
1,000,705
- Positive
- Odd
- Composite
- 7 digits
1,000,705 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,000,705
Digit count7
Digit sum13
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 × 17 × 61 × 193
Distinct prime factors45, 17, 61, 193
Number of divisors16
Sum of divisors σ(n)1,299,024
Aliquot sum298,319sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)737,280integers below n that share no factor with it
Carmichael function λ(n)960the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 737,280
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 17, 61, 85, 193, 305, 965, 1,037, 3,281, 5,185, 11,773, 16,405, 58,865, 200,141, 1,000,70516 in total
Arithmetic
Previous number1,000,704
Next number1,000,706
Double2,001,410
Half500,352.5
Square1,001,410,497,025
Cube1,002,116,491,425,402,625
Square root1,000.352437894≈irrational, shown to 9 decimal places
Cube root100.02349448≈
Negation-1,000,705
Reciprocal9.99295497 × 10^-7≈
Representations
Decimal1,000,705
Binary1111010001010000000120 bits
Octal3642401
HexadecimalF4501
Base 36LG5D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seven hundred and five
Ordinalone million, seven hundred and fifth
Scientific notation1.000705 × 10^6
Engineering notation1.000705 × 10^6
In other bases
Ternary1212211201011base 3; the most digit-efficient integer base after e: 13 digits
Quinary224010310base 5; one hand: 9 digits
Septenary11335336base 7: 8 digits
Nonary1784634base 9; each digit is two ternary digits: 7 digits
Duodecimal403141base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal651f5base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:37:58:25base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T00TTT01011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100110100010100000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011110100010100000001
Bit length20 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits12within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 19worth 524,288
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes30f 45 01
Gray code10001110011110000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011110100010100000001
64-bit0000000000000000000000000000000000000000000011110100010100000001
One's complement11111111111100001011101011111110at 32 bits, every bit flipped
Bits reversed10000000101000101111000000000000at 32 bits
Rotated left by 100000000000111101000101000000010at 32 bits, wrapping
Shifted left by 1111101000101000000010= 2,001,410, no wrap
Shifted right by 11111010001010000000= 500,352, discarding the low bit
These bits as a double4.94413962 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,000,705 to the power 21,001,410,497,025
1,000,705 to the power 31,002,116,491,425,402,625
1,000,705 to the power 41,002,822,983,551,857,533,850,625
1,000,705 to the power 51,003,529,973,755,261,593,411,989,690,625
First ten multiples1,000,705, 2,001,410, 3,002,115, 4,002,820, 5,003,525, 6,004,230, 7,004,935, 8,005,640, 9,006,345, 10,007,050
Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 5
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 5
Collatz (3n + 1) trajectory
Steps to reach 1139the total stopping time
Highest value reached3,002,1163× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,000,705 → 3,002,116 → 1,501,058 → 750,529 → 2,251,588 → 1,125,794 → 562,897 → 1,688,692 → 844,346 → 422,173 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage100,070,500%
1,000,705% as a decimal10,007.05
1,000,705% of 1001,000,705
1,000,705% of 1,00010,007,050
As a fraction of 1001,000,705/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,000,705
Nerdulate something else
Nothing in mind? Surprise me · today’s page