Recognised as Number
5,617,361
- Positive
- Odd
- Composite
- 7 digits
5,617,361 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value5,617,361
Digit count7
Digit sum29
Digit product3,780
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation17 × 330,433
Distinct prime factors217, 330,433
Number of divisors4
Sum of divisors σ(n)5,947,812
Aliquot sum330,451sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,286,912integers below n that share no factor with it
Carmichael function λ(n)330,432the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,286,912
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 17, 330,433, 5,617,3614 in total
Arithmetic
Previous number5,617,360
Next number5,617,362
Double11,234,722
Half2,808,680.5
Square31,554,744,604,321
Cube177,254,391,705,273,216,881
Square root2,370.097255388≈irrational, shown to 9 decimal places
Cube root177.764121766≈
Negation-5,617,361
Reciprocal1.78019536 × 10^-7≈
Representations
Decimal5,617,361
Binary1010101101101101101000123 bits
Octal25333321
Hexadecimal55B6D1
Base 363CEDT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, six hundred and seventeen thousand, three hundred and sixty-one
Ordinalfive million, six hundred and seventeen thousand, three hundred and sixty-first
Scientific notation5.617361 × 10^6
Engineering notation5.617361 × 10^6
In other bases
Ternary101120101120102base 3; the most digit-efficient integer base after e: 15 digits
Quinary2414223421base 5; one hand: 10 digits
Septenary65514101base 7: 8 digits
Nonary11511512base 9; each digit is two ternary digits: 8 digits
Duodecimal1a6a955base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1f2381base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal26:0:22:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11TTT011TTT011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010101100101111010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010101011011011011010001
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes355 b6 d1
Gray code11111110110110110111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010101011011011011010001
64-bit0000000000000000000000000000000000000000010101011011011011010001
One's complement11111111101010100100100100101110at 32 bits, every bit flipped
Bits reversed10001011011011011010101000000000at 32 bits
Rotated left by 100000000101010110110110110100010at 32 bits, wrapping
Shifted left by 1101010110110110110100010= 11,234,722, no wrap
Shifted right by 11010101101101101101000= 2,808,680, discarding the low bit
These bits as a double2.77534509 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,617,361 to the power 231,554,744,604,321
5,617,361 to the power 3177,254,391,705,273,216,881
5,617,361 to the power 4995,701,907,043,925,262,851,871,041
5,617,361 to the power 55,593,217,060,254,171,058,458,849,162,742,801
First ten multiples5,617,361, 11,234,722, 16,852,083, 22,469,444, 28,086,805, 33,704,166, 39,321,527, 44,938,888, 50,556,249, 56,173,610
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1170the total stopping time
Highest value reached16,852,0843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,617,361 → 16,852,084 → 8,426,042 → 4,213,021 → 12,639,064 → 6,319,532 → 3,159,766 → 1,579,883 → 4,739,650 → 2,369,825 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage561,736,100%
5,617,361% as a decimal56,173.61
5,617,361% of 1005,617,361
5,617,361% of 1,00056,173,610
As a fraction of 1005,617,361/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 5,617,361
Nerdulate something else
Nothing in mind? Surprise me · today’s page