Recognised as Number
3,729,668
- Positive
- Even
- Composite
- 7 digits
3,729,668 is an even 7-digit integer and a composite number. It has 6 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,729,668
Digit count7
Digit sum41
Digit product108,864
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 factorisation2^2 × 932,417
Distinct prime factors22, 932,417
Number of divisors6
Sum of divisors σ(n)6,526,926
Aliquot sum2,797,258sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,864,832integers below n that share no factor with it
Carmichael function λ(n)932,416the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,864,832
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 932,417, 1,864,834, 3,729,6686 in total
Arithmetic
Previous number3,729,667
Next number3,729,669
Double7,459,336
Half1,864,834
Square13,910,423,390,224
Cube51,881,260,984,969,965,632
Square root1,931.234838128≈irrational, shown to 9 decimal places
Cube root155.080332968≈
Negation-3,729,668
Reciprocal2.6812038 × 10^-7≈
Representations
Decimal3,729,668
Binary111000111010010000010022 bits
Octal16164404
Hexadecimal38E904
Base 3627XTW
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred and twenty-nine thousand, six hundred and sixty-eight
Ordinalthree million, seven hundred and twenty-nine thousand, six hundred and sixty-eighth
Scientific notation3.729668 × 10^6
Engineering notation3.729668 × 10^6
In other bases
Ternary21000111010212base 3; the most digit-efficient integer base after e: 14 digits
Quinary1423322133base 5; one hand: 10 digits
Septenary43462445base 7: 8 digits
Nonary7014125base 9; each digit is two ternary digits: 7 digits
Duodecimal12ba458base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal136438base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:16:1:8base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10001110110TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010010011100100000100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110001110100100000100
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 even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes338 e9 04
Gray code1001001001110110000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110001110100100000100
64-bit0000000000000000000000000000000000000000001110001110100100000100
One's complement11111111110001110001011011111011at 32 bits, every bit flipped
Bits reversed00100000100101110001110000000000at 32 bits
Rotated left by 100000000011100011101001000001000at 32 bits, wrapping
Shifted left by 111100011101001000001000= 7,459,336, no wrap
Shifted right by 1111000111010010000010= 1,864,834, discarding the low bit
These bits as a double1.84270083 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,729,668 to the power 213,910,423,390,224
3,729,668 to the power 351,881,260,984,969,965,632
3,729,668 to the power 4193,499,878,895,290,961,778,770,176
3,729,668 to the power 5721,690,306,319,642,050,835,502,204,781,568
First ten multiples3,729,668, 7,459,336, 11,189,004, 14,918,672, 18,648,340, 22,378,008, 26,107,676, 29,837,344, 33,567,012, 37,296,680
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7No, remainder 5
Divisible by 8No, remainder 4
Divisible by 9No, remainder 5
Divisible by 10No, remainder 8
Divisible by 11No, remainder 8
Divisible by 12No, remainder 8
Divisible by 100No, remainder 68
Collatz (3n + 1) trajectory
Steps to reach 166the total stopping time
Highest value reached3,729,668
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,729,668 → 1,864,834 → 932,417 → 2,797,252 → 1,398,626 → 699,313 → 2,097,940 → 1,048,970 → 524,485 → 1,573,456 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage372,966,800%
3,729,668% as a decimal37,296.68
3,729,668% of 1003,729,668
3,729,668% of 1,00037,296,680
As a fraction of 1003,729,668/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,729,668
Nerdulate something else
Nothing in mind? Surprise me · today’s page