Recognised as Number
1,731,643
- Positive
- Odd
- Prime
- 7 digits
1,731,643 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,731,643
Digit count7
Digit sum25
Digit product1,512
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 factorisation1,731,643
Distinct prime factors11,731,643
Number of divisors2
Sum of divisors σ(n)1,731,644
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,731,642integers below n that share no factor with it
Carmichael function λ(n)1,731,642the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,731,6432 in total
Arithmetic
Previous number1,731,642
Next number1,731,644
Double3,463,286
Half865,821.5
Square2,998,587,479,449
Cube5,192,483,018,675,504,707
Square root1,315.91907046≈irrational, shown to 9 decimal places
Cube root120.084269512≈
Negation-1,731,643
Reciprocal5.77486237 × 10^-7≈
Representations
Decimal1,731,643
Binary11010011011000011101121 bits
Octal6466073
Hexadecimal1A6C3B
Base 3611457
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seven hundred and thirty-one thousand, six hundred and forty-three
Ordinalone million, seven hundred and thirty-one thousand, six hundred and forty-third
Scientific notation1.731643 × 10^6
Engineering notation1.731643 × 10^6
In other bases
Ternary10020222100221base 3; the most digit-efficient integer base after e: 14 digits
Quinary420403033base 5; one hand: 9 digits
Septenary20501344base 7: 8 digits
Nonary3228327base 9; each digit is two ternary digits: 7 digits
Duodecimal6b6137base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalag923base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal8:1:0:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101T100T1010T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011111011110001001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110100110110000111011
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 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
Bytes31a 6c 3b
Gray code101110101101000100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110100110110000111011
64-bit0000000000000000000000000000000000000000000110100110110000111011
One's complement11111111111001011001001111000100at 32 bits, every bit flipped
Bits reversed11011100001101100101100000000000at 32 bits
Rotated left by 100000000001101001101100001110110at 32 bits, wrapping
Shifted left by 11101001101100001110110= 3,463,286, no wrap
Shifted right by 111010011011000011101= 865,821, discarding the low bit
These bits as a double8.55545317 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,731,643 to the power 22,998,587,479,449
1,731,643 to the power 35,192,483,018,675,504,707
1,731,643 to the power 48,991,526,871,908,306,997,343,601
1,731,643 to the power 515,570,114,567,051,916,453,801,065,266,443
First ten multiples1,731,643, 3,463,286, 5,194,929, 6,926,572, 8,658,215, 10,389,858, 12,121,501, 13,853,144, 15,584,787, 17,316,430
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 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 43
Collatz (3n + 1) trajectory
Steps to reach 1127the total stopping time
Highest value reached12,481,9367× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,731,643 → 5,194,930 → 2,597,465 → 7,792,396 → 3,896,198 → 1,948,099 → 5,844,298 → 2,922,149 → 8,766,448 → 4,383,224 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage173,164,300%
1,731,643% as a decimal17,316.43
1,731,643% of 1001,731,643
1,731,643% of 1,00017,316,430
As a fraction of 1001,731,643/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,731,643
Nerdulate something else
Nothing in mind? Surprise me · today’s page