Recognised as Number
1,723,391
- Positive
- Odd
- Composite
- 7 digits
1,723,391 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,723,391
Digit count7
Digit sum26
Digit product1,134
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation241 × 7,151
Distinct prime factors2241, 7,151
Number of divisors4
Sum of divisors σ(n)1,730,784
Aliquot sum7,393sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,716,000integers below n that share no factor with it
Carmichael function λ(n)171,600the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,716,000
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 241, 7,151, 1,723,3914 in total
Arithmetic
Previous number1,723,390
Next number1,723,392
Double3,446,782
Half861,695.5
Square2,970,076,538,881
Cube5,118,603,176,418,665,471
Square root1,312.779874922≈irrational, shown to 9 decimal places
Cube root119.893215188≈
Negation-1,723,391
Reciprocal5.80251377 × 10^-7≈
Representations
Decimal1,723,391
Binary11010010010111111111121 bits
Octal6445777
Hexadecimal1A4BFF
Base 3610XRZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seven hundred and twenty-three thousand, three hundred and ninety-one
Ordinalone million, seven hundred and twenty-three thousand, three hundred and ninety-first
Scientific notation1.723391 × 10^6
Engineering notation1.723391 × 10^6
In other bases
Ternary10020120001022base 3; the most digit-efficient integer base after e: 14 digits
Quinary420122031base 5; one hand: 9 digits
Septenary20435315base 7: 8 digits
Nonary3216038base 9; each digit is two ternary digits: 7 digits
Duodecimal6b13bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalaf89bbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:58:43:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101T1TT000110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011100101110000000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110100100101111111111
Bit length21 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits6within that length
Bit parityodd15 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
Bytes31a 4b ff
Gray code101110110111000000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110100100101111111111
64-bit0000000000000000000000000000000000000000000110100100101111111111
One's complement11111111111001011011010000000000at 32 bits, every bit flipped
Bits reversed11111111110100100101100000000000at 32 bits
Rotated left by 100000000001101001001011111111110at 32 bits, wrapping
Shifted left by 11101001001011111111110= 3,446,782, no wrap
Shifted right by 111010010010111111111= 861,695, discarding the low bit
These bits as a double8.51468287 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,723,391 to the power 22,970,076,538,881
1,723,391 to the power 35,118,603,176,418,665,471
1,723,391 to the power 48,821,354,646,811,340,304,732,161
1,723,391 to the power 515,202,643,206,122,842,579,112,663,677,951
First ten multiples1,723,391, 3,446,782, 5,170,173, 6,893,564, 8,616,955, 10,340,346, 12,063,737, 13,787,128, 15,510,519, 17,233,910
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1158the total stopping time
Highest value reached198,758,932115× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,723,391 → 5,170,174 → 2,585,087 → 7,755,262 → 3,877,631 → 11,632,894 → 5,816,447 → 17,449,342 → 8,724,671 → 26,174,014 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage172,339,100%
1,723,391% as a decimal17,233.91
1,723,391% of 1001,723,391
1,723,391% of 1,00017,233,910
As a fraction of 1001,723,391/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,723,391
Nerdulate something else
Nothing in mind? Surprise me · today’s page