Recognised as Number
1,551,617
- Positive
- Odd
- Prime
- 7 digits
1,551,617 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,551,617
Digit count7
Digit sum26
Digit product1,050
Multiplicative persistence2times 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 factorisation1,551,617
Distinct prime factors11,551,617
Number of divisors2
Sum of divisors σ(n)1,551,618
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,551,616integers below n that share no factor with it
Carmichael function λ(n)1,551,616the 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,551,6172 in total
Arithmetic
Previous number1,551,616
Next number1,551,618
Double3,103,234
Half775,808.5
Square2,407,515,314,689
Cube3,735,541,690,031,802,113
Square root1,245.639193346≈irrational, shown to 9 decimal places
Cube root115.769682724≈
Negation-1,551,617
Reciprocal6.44488943 × 10^-7≈
Representations
Decimal1,551,617
Binary10111101011010000000121 bits
Octal5726401
Hexadecimal17AD01
Base 36X98H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and fifty-one thousand, six hundred and seventeen
Ordinalone million, five hundred and fifty-one thousand, six hundred and seventeenth
Scientific notation1.551617 × 10^6
Engineering notation1.551617 × 10^6
In other bases
Ternary2220211102022base 3; the most digit-efficient integer base after e: 13 digits
Quinary344122432base 5; one hand: 9 digits
Septenary16121444base 7: 8 digits
Nonary2824368base 9; each digit is two ternary digits: 7 digits
Duodecimal629b15base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9dj0hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:11:0:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T1T1111T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010001111110100000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101111010110100000001
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
Bytes317 ad 01
Gray code111000111101110000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101111010110100000001
64-bit0000000000000000000000000000000000000000000101111010110100000001
One's complement11111111111010000101001011111110at 32 bits, every bit flipped
Bits reversed10000000101101011110100000000000at 32 bits
Rotated left by 100000000001011110101101000000010at 32 bits, wrapping
Shifted left by 11011110101101000000010= 3,103,234, no wrap
Shifted right by 110111101011010000000= 775,808, discarding the low bit
These bits as a double7.66600655 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,551,617 to the power 22,407,515,314,689
1,551,617 to the power 33,735,541,690,031,802,113
1,551,617 to the power 45,796,129,990,462,074,699,166,721
1,551,617 to the power 58,993,373,827,410,792,958,496,970,137,857
First ten multiples1,551,617, 3,103,234, 4,654,851, 6,206,468, 7,758,085, 9,309,702, 10,861,319, 12,412,936, 13,964,553, 15,516,170
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 17
Collatz (3n + 1) trajectory
Steps to reach 1194the total stopping time
Highest value reached9,565,9366× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,551,617 → 4,654,852 → 2,327,426 → 1,163,713 → 3,491,140 → 1,745,570 → 872,785 → 2,618,356 → 1,309,178 → 654,589 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage155,161,700%
1,551,617% as a decimal15,516.17
1,551,617% of 1001,551,617
1,551,617% of 1,00015,516,170
As a fraction of 1001,551,617/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,551,617
Nerdulate something else
Nothing in mind? Surprise me · today’s page