Recognised as Number
3,674,129
- Positive
- Odd
- Prime
- 7 digits
3,674,129 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,674,129
Digit count7
Digit sum32
Digit product9,072
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,674,129
Distinct prime factors13,674,129
Number of divisors2
Sum of divisors σ(n)3,674,130
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,674,128integers below n that share no factor with it
Carmichael function λ(n)3,674,128the 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,1292 in total
Arithmetic
Previous number3,674,128
Next number3,674,130
Double7,348,258
Half1,837,064.5
Square13,499,223,908,641
Cube49,597,890,040,231,248,689
Square root1,916.801763355≈irrational, shown to 9 decimal places
Cube root154.306705902≈
Negation-3,674,129
Reciprocal2.7217335 × 10^-7≈
Representations
Decimal3,674,129
Binary111000000100000001000122 bits
Octal16010021
Hexadecimal381011
Base 3626QZ5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and seventy-four thousand, one hundred and twenty-nine
Ordinalthree million, six hundred and seventy-four thousand, one hundred and twenty-ninth
Scientific notation3.674129 × 10^6
Engineering notation3.674129 × 10^6
In other bases
Ternary20220122221212base 3; the most digit-efficient integer base after e: 14 digits
Quinary1420033004base 5; one hand: 10 digits
Septenary43141514base 7: 8 digits
Nonary6818855base 9; each digit is two ternary digits: 7 digits
Duodecimal1292295base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12j569base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:0:35:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10T1T0000T0TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010000001000000010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110000001000000010001
Bit length22 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits16within that length
Bit parityeven6 set bits, so even; 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 10 11
Gray code1001000001100000011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110000001000000010001
64-bit0000000000000000000000000000000000000000001110000001000000010001
One's complement11111111110001111110111111101110at 32 bits, every bit flipped
Bits reversed10001000000010000001110000000000at 32 bits
Rotated left by 100000000011100000010000000100010at 32 bits, wrapping
Shifted left by 111100000010000000100010= 7,348,258, no wrap
Shifted right by 1111000000100000001000= 1,837,064, discarding the low bit
These bits as a double1.81526092 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,674,129 to the power 213,499,223,908,641
3,674,129 to the power 349,597,890,040,231,248,689
3,674,129 to the power 4182,229,046,135,624,797,514,466,881
3,674,129 to the power 5669,533,023,049,237,001,667,030,687,021,649
First ten multiples3,674,129, 7,348,258, 11,022,387, 14,696,516, 18,370,645, 22,044,774, 25,718,903, 29,393,032, 33,067,161, 36,741,290
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 5
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached11,022,3883× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,674,129 → 11,022,388 → 5,511,194 → 2,755,597 → 8,266,792 → 4,133,396 → 2,066,698 → 1,033,349 → 3,100,048 → 1,550,024 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage367,412,900%
3,674,129% as a decimal36,741.29
3,674,129% of 1003,674,129
3,674,129% of 1,00036,741,290
As a fraction of 1003,674,129/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,129
Nerdulate something else
Nothing in mind? Surprise me · today’s page