Recognised as Number
1,597,009
- Positive
- Odd
- Composite
- 7 digits
1,597,009 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,597,009
Digit count7
Digit sum31
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 factorisation137 × 11,657
Distinct prime factors2137, 11,657
Number of divisors4
Sum of divisors σ(n)1,608,804
Aliquot sum11,795sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,585,216integers below n that share no factor with it
Carmichael function λ(n)198,152the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,585,216
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 137, 11,657, 1,597,0094 in total
Arithmetic
Previous number1,597,008
Next number1,597,010
Double3,194,018
Half798,504.5
Square2,550,437,746,081
Cube4,073,072,034,431,071,729
Square root1,263.728214451≈irrational, shown to 9 decimal places
Cube root116.887782925≈
Negation-1,597,009
Reciprocal6.26170548 × 10^-7≈
Representations
Decimal1,597,009
Binary11000010111100101000121 bits
Octal6057121
Hexadecimal185E51
Base 36Y89D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and ninety-seven thousand and nine
Ordinalone million, five hundred and ninety-seven thousand and ninth
Scientific notation1.597009 × 10^6
Engineering notation1.597009 × 10^6
In other bases
Ternary10000010200111base 3; the most digit-efficient integer base after e: 14 digits
Quinary402101014base 5; one hand: 9 digits
Septenary16401001base 7: 8 digits
Nonary3003614base 9; each digit is two ternary digits: 7 digits
Duodecimal650241base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9jca9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:23:36:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10000011T00111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011010001001010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110000101111001010001
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 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
Bytes318 5e 51
Gray code101000111000101111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110000101111001010001
64-bit0000000000000000000000000000000000000000000110000101111001010001
One's complement11111111111001111010000110101110at 32 bits, every bit flipped
Bits reversed10001010011110100001100000000000at 32 bits
Rotated left by 100000000001100001011110010100010at 32 bits, wrapping
Shifted left by 11100001011110010100010= 3,194,018, no wrap
Shifted right by 111000010111100101000= 798,504, discarding the low bit
These bits as a double7.89027283 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,597,009 to the power 22,550,437,746,081
1,597,009 to the power 34,073,072,034,431,071,729
1,597,009 to the power 46,504,732,696,634,731,430,858,561
1,597,009 to the power 510,388,116,659,119,935,807,663,999,644,049
First ten multiples1,597,009, 3,194,018, 4,791,027, 6,388,036, 7,985,045, 9,582,054, 11,179,063, 12,776,072, 14,373,081, 15,970,090
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1119the total stopping time
Highest value reached4,791,0283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,597,009 → 4,791,028 → 2,395,514 → 1,197,757 → 3,593,272 → 1,796,636 → 898,318 → 449,159 → 1,347,478 → 673,739 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage159,700,900%
1,597,009% as a decimal15,970.09
1,597,009% of 1001,597,009
1,597,009% of 1,00015,970,090
As a fraction of 1001,597,009/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,009
Nerdulate something else
Nothing in mind? Surprise me · today’s page