Recognised as Number
3,674,719
- Positive
- Odd
- Prime
- 7 digits
3,674,719 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,674,719
Digit count7
Digit sum37
Digit product31,752
Multiplicative persistence3times 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 factorisation3,674,719
Distinct prime factors13,674,719
Number of divisors2
Sum of divisors σ(n)3,674,720
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,674,718integers below n that share no factor with it
Carmichael function λ(n)3,674,718the 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,674,7192 in total
Arithmetic
Previous number3,674,718
Next number3,674,720
Double7,349,438
Half1,837,359.5
Square13,503,559,728,961
Cube49,621,787,503,647,836,959
Square root1,916.955659372≈irrational, shown to 9 decimal places
Cube root154.3149651≈
Negation-3,674,719
Reciprocal2.72129651 × 10^-7≈
Representations
Decimal3,674,719
Binary111000000100100101111122 bits
Octal16011137
Hexadecimal38125F
Base 3626RFJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and seventy-four thousand, seven hundred and nineteen
Ordinalthree million, six hundred and seventy-four thousand, seven hundred and nineteenth
Scientific notation3.674719 × 10^6
Engineering notation3.674719 × 10^6
In other bases
Ternary20220200202201base 3; the most digit-efficient integer base after e: 14 digits
Quinary1420042334base 5; one hand: 10 digits
Septenary43143316base 7: 8 digits
Nonary6820681base 9; each digit is two ternary digits: 7 digits
Duodecimal12926a7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12j6fjbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:0:45:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10T1T01T10T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010000001011110100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110000001001001011111
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
Bytes338 12 5f
Gray code1001000001101101110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110000001001001011111
64-bit0000000000000000000000000000000000000000001110000001001001011111
One's complement11111111110001111110110110100000at 32 bits, every bit flipped
Bits reversed11111010010010000001110000000000at 32 bits
Rotated left by 100000000011100000010010010111110at 32 bits, wrapping
Shifted left by 111100000010010010111110= 7,349,438, no wrap
Shifted right by 1111000000100100101111= 1,837,359, discarding the low bit
These bits as a double1.81555242 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,674,719 to the power 213,503,559,728,961
3,674,719 to the power 349,621,787,503,647,836,959
3,674,719 to the power 4182,346,125,353,617,275,782,139,521
3,674,719 to the power 5670,070,771,413,319,122,044,867,958,469,599
First ten multiples3,674,719, 7,349,438, 11,024,157, 14,698,876, 18,373,595, 22,048,314, 25,723,033, 29,397,752, 33,072,471, 36,747,190
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 19
Collatz (3n + 1) trajectory
Steps to reach 1203the total stopping time
Highest value reached55,809,80815× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,674,719 → 11,024,158 → 5,512,079 → 16,536,238 → 8,268,119 → 24,804,358 → 12,402,179 → 37,206,538 → 18,603,269 → 55,809,808 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage367,471,900%
3,674,719% as a decimal36,747.19
3,674,719% of 1003,674,719
3,674,719% of 1,00036,747,190
As a fraction of 1003,674,719/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,674,719
Nerdulate something else
Nothing in mind? Surprise me · today’s page