Recognised as Number
3,678,617
- Positive
- Odd
- Prime
- 7 digits
3,678,617 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,678,617
Digit count7
Digit sum38
Digit product42,336
Multiplicative persistence4times 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 factorisation3,678,617
Distinct prime factors13,678,617
Number of divisors2
Sum of divisors σ(n)3,678,618
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,678,616integers below n that share no factor with it
Carmichael function λ(n)3,678,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, 3,678,6172 in total
Arithmetic
Previous number3,678,616
Next number3,678,618
Double7,357,234
Half1,839,308.5
Square13,532,223,032,689
Cube49,779,865,695,841,311,113
Square root1,917.972106158≈irrational, shown to 9 decimal places
Cube root154.369509604≈
Negation-3,678,617
Reciprocal2.71841293 × 10^-7≈
Representations
Decimal3,678,617
Binary111000001000011001100122 bits
Octal16020631
Hexadecimal382199
Base 3626UFT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and seventy-eight thousand, six hundred and seventeen
Ordinalthree million, six hundred and seventy-eight thousand, six hundred and seventeenth
Scientific notation3.678617 × 10^6
Engineering notation3.678617 × 10^6
In other bases
Ternary20220220010002base 3; the most digit-efficient integer base after e: 14 digits
Quinary1420203432base 5; one hand: 10 digits
Septenary43160555base 7: 8 digits
Nonary6826102base 9; each digit is two ternary digits: 7 digits
Duodecimal12949b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12jgahbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:1:50:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10T10T001001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010000110011011101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110000010000110011001
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 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
Bytes338 21 99
Gray code1001000011000101010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110000010000110011001
64-bit0000000000000000000000000000000000000000001110000010000110011001
One's complement11111111110001111101111001100110at 32 bits, every bit flipped
Bits reversed10011001100001000001110000000000at 32 bits
Rotated left by 100000000011100000100001100110010at 32 bits, wrapping
Shifted left by 111100000100001100110010= 7,357,234, no wrap
Shifted right by 1111000001000011001100= 1,839,308, discarding the low bit
These bits as a double1.81747828 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,678,617 to the power 213,532,223,032,689
3,678,617 to the power 349,779,865,695,841,311,113
3,678,617 to the power 4183,121,060,206,438,676,362,570,721
3,678,617 to the power 5673,632,245,133,428,824,324,850,817,972,857
First ten multiples3,678,617, 7,357,234, 11,035,851, 14,714,468, 18,393,085, 22,071,702, 25,750,319, 29,428,936, 33,107,553, 36,786,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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 5
Divisible by 100No, remainder 17
Collatz (3n + 1) trajectory
Steps to reach 1159the total stopping time
Highest value reached12,415,3363× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,678,617 → 11,035,852 → 5,517,926 → 2,758,963 → 8,276,890 → 4,138,445 → 12,415,336 → 6,207,668 → 3,103,834 → 1,551,917 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage367,861,700%
3,678,617% as a decimal36,786.17
3,678,617% of 1003,678,617
3,678,617% of 1,00036,786,170
As a fraction of 1003,678,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 3,678,617
Nerdulate something else
Nothing in mind? Surprise me · today’s page