Recognised as Number
1,597,723
- Positive
- Odd
- Prime
- 7 digits
1,597,723 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,597,723
Digit count7
Digit sum34
Digit product13,230
Multiplicative persistence2times 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,597,723
Distinct prime factors11,597,723
Number of divisors2
Sum of divisors σ(n)1,597,724
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,597,722integers below n that share no factor with it
Carmichael function λ(n)1,597,722the 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,597,7232 in total
Arithmetic
Previous number1,597,722
Next number1,597,724
Double3,195,446
Half798,861.5
Square2,552,718,784,729
Cube4,078,537,514,893,572,067
Square root1,264.010680335≈irrational, shown to 9 decimal places
Cube root116.905199951≈
Negation-1,597,723
Reciprocal6.25890721 × 10^-7≈
Representations
Decimal1,597,723
Binary11000011000010001101121 bits
Octal6060433
Hexadecimal18611B
Base 36Y8T7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and ninety-seven thousand, seven hundred and twenty-three
Ordinalone million, five hundred and ninety-seven thousand, seven hundred and twenty-third
Scientific notation1.597723 × 10^6
Engineering notation1.597723 × 10^6
In other bases
Ternary10000011122221base 3; the most digit-efficient integer base after e: 14 digits
Quinary402111343base 5; one hand: 9 digits
Septenary16403041base 7: 8 digits
Nonary3004587base 9; each digit is two ternary digits: 7 digits
Duodecimal650737base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9je63base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:23:48:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100001TTT000T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011010000101101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110000110000100011011
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 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
Bytes318 61 1b
Gray code101000101000110010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110000110000100011011
64-bit0000000000000000000000000000000000000000000110000110000100011011
One's complement11111111111001111001111011100100at 32 bits, every bit flipped
Bits reversed11011000100001100001100000000000at 32 bits
Rotated left by 100000000001100001100001000110110at 32 bits, wrapping
Shifted left by 11100001100001000110110= 3,195,446, no wrap
Shifted right by 111000011000010001101= 798,861, discarding the low bit
These bits as a double7.89380046 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,597,723 to the power 22,552,718,784,729
1,597,723 to the power 34,078,537,514,893,572,067
1,597,723 to the power 46,516,373,193,908,302,643,603,441
1,597,723 to the power 510,411,359,328,490,755,024,646,020,564,843
First ten multiples1,597,723, 3,195,446, 4,793,169, 6,390,892, 7,988,615, 9,586,338, 11,184,061, 12,781,784, 14,379,507, 15,977,230
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 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 23
Collatz (3n + 1) trajectory
Steps to reach 1119the total stopping time
Highest value reached87,454,24054× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,597,723 → 4,793,170 → 2,396,585 → 7,189,756 → 3,594,878 → 1,797,439 → 5,392,318 → 2,696,159 → 8,088,478 → 4,044,239 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage159,772,300%
1,597,723% as a decimal15,977.23
1,597,723% of 1001,597,723
1,597,723% of 1,00015,977,230
As a fraction of 1001,597,723/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,597,723
Nerdulate something else
Nothing in mind? Surprise me · today’s page