Recognised as Number
3,617,317
- Positive
- Odd
- Composite
- 7 digits
3,617,317 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,617,317
Digit count7
Digit sum28
Digit product2,646
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation11 × 328,847
Distinct prime factors211, 328,847
Number of divisors4
Sum of divisors σ(n)3,946,176
Aliquot sum328,859sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,288,460integers below n that share no factor with it
Carmichael function λ(n)1,644,230the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,288,460
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 328,847, 3,617,3174 in total
Arithmetic
Previous number3,617,316
Next number3,617,318
Double7,234,634
Half1,808,658.5
Square13,084,982,278,489
Cube47,332,528,840,676,994,013
Square root1,901.924551606≈irrational, shown to 9 decimal places
Cube root153.507237578≈
Negation-3,617,317
Reciprocal2.76447986 × 10^-7≈
Representations
Decimal3,617,317
Binary110111001100100010010122 bits
Octal15631045
Hexadecimal373225
Base 3625J51
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and seventeen thousand, three hundred and seventeen
Ordinalthree million, six hundred and seventeen thousand, three hundred and seventeenth
Scientific notation3.617317 × 10^6
Engineering notation3.617317 × 10^6
In other bases
Ternary20210210000201base 3; the most digit-efficient integer base after e: 14 digits
Quinary1411223232base 5; one hand: 10 digits
Septenary42514054base 7: 8 digits
Nonary6723021base 9; each digit is two ternary digits: 7 digits
Duodecimal1265431base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12c35hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:44:48:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T11T10001T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110111011001100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110011001000100101
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes337 32 25
Gray code1011001010101100110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110011001000100101
64-bit0000000000000000000000000000000000000000001101110011001000100101
One's complement11111111110010001100110111011010at 32 bits, every bit flipped
Bits reversed10100100010011001110110000000000at 32 bits
Rotated left by 100000000011011100110010001001010at 32 bits, wrapping
Shifted left by 111011100110010001001010= 7,234,634, no wrap
Shifted right by 1110111001100100010010= 1,808,658, discarding the low bit
These bits as a double1.78719206 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,617,317 to the power 213,084,982,278,489
3,617,317 to the power 347,332,528,840,676,994,013
3,617,317 to the power 4171,216,761,228,371,181,952,123,121
3,617,317 to the power 5619,345,301,076,327,958,785,508,151,686,357
First ten multiples3,617,317, 7,234,634, 10,851,951, 14,469,268, 18,086,585, 21,703,902, 25,321,219, 28,938,536, 32,555,853, 36,173,170
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11Yes
Divisible by 12No, remainder 1
Divisible by 100No, remainder 17
Collatz (3n + 1) trajectory
Steps to reach 1141the total stopping time
Highest value reached17,382,7604× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,617,317 → 10,851,952 → 5,425,976 → 2,712,988 → 1,356,494 → 678,247 → 2,034,742 → 1,017,371 → 3,052,114 → 1,526,057 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage361,731,700%
3,617,317% as a decimal36,173.17
3,617,317% of 1003,617,317
3,617,317% of 1,00036,173,170
As a fraction of 1003,617,317/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 3,617,317
Nerdulate something else
Nothing in mind? Surprise me · today’s page