Recognised as Number
3,781,379
- Positive
- Odd
- Composite
- 7 digits
3,781,379 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,781,379
Digit count7
Digit sum38
Digit product31,752
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7^2 × 77,171
Distinct prime factors27, 77,171
Number of divisors6
Sum of divisors σ(n)4,398,804
Aliquot sum617,425sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,241,140integers below n that share no factor with it
Carmichael function λ(n)1,620,570the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,241,140
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 7, 49, 77,171, 540,197, 3,781,3796 in total
Arithmetic
Previous number3,781,378
Next number3,781,380
Double7,562,758
Half1,890,689.5
Square14,298,827,141,641
Cube54,069,284,678,031,302,939
Square root1,944.576817716≈irrational, shown to 9 decimal places
Cube root155.79376374≈
Negation-3,781,379
Reciprocal2.64453788 × 10^-7≈
Representations
Decimal3,781,379
Binary111001101100110000001122 bits
Octal16331403
Hexadecimal39B303
Base 36291QB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred and eighty-one thousand, three hundred and seventy-nine
Ordinalthree million, seven hundred and eighty-one thousand, three hundred and seventy-ninth
Scientific notation3.781379 × 10^6
Engineering notation3.781379 × 10^6
In other bases
Ternary21010010002002base 3; the most digit-efficient integer base after e: 14 digits
Quinary1432001004base 5; one hand: 10 digits
Septenary44066300base 7: 8 digits
Nonary7103062base 9; each digit is two ternary digits: 7 digits
Duodecimal132436bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal13cd8jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:30:22:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T101001001T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011101111011100000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110011011001100000011
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
Bytes339 b3 03
Gray code1001010110101010000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110011011001100000011
64-bit0000000000000000000000000000000000000000001110011011001100000011
One's complement11111111110001100100110011111100at 32 bits, every bit flipped
Bits reversed11000000110011011001110000000000at 32 bits
Rotated left by 100000000011100110110011000000110at 32 bits, wrapping
Shifted left by 111100110110011000000110= 7,562,758, no wrap
Shifted right by 1111001101100110000001= 1,890,689, discarding the low bit
These bits as a double1.86824946 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,781,379 to the power 214,298,827,141,641
3,781,379 to the power 354,069,284,678,031,302,939
3,781,379 to the power 4204,456,457,626,529,330,276,172,881
3,781,379 to the power 5773,127,355,283,347,852,390,384,332,582,899
First ten multiples3,781,379, 7,562,758, 11,344,137, 15,125,516, 18,906,895, 22,688,274, 26,469,653, 30,251,032, 34,032,411, 37,813,790
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 11
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1110the total stopping time
Highest value reached17,016,2084× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,781,379 → 11,344,138 → 5,672,069 → 17,016,208 → 8,508,104 → 4,254,052 → 2,127,026 → 1,063,513 → 3,190,540 → 1,595,270 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage378,137,900%
3,781,379% as a decimal37,813.79
3,781,379% of 1003,781,379
3,781,379% of 1,00037,813,790
As a fraction of 1003,781,379/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,781,379
Nerdulate something else
Nothing in mind? Surprise me · today’s page