Recognised as Number
3,827,673
- Positive
- Odd
- Composite
- 7 digits
3,827,673 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,827,673
Digit count7
Digit sum36
Digit product42,336
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 425,297
Distinct prime factors23, 425,297
Number of divisors6
Sum of divisors σ(n)5,528,874
Aliquot sum1,701,201sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,551,776integers below n that share no factor with it
Carmichael function λ(n)1,275,888the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,551,776
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 425,297, 1,275,891, 3,827,6736 in total
Arithmetic
Previous number3,827,672
Next number3,827,674
Double7,655,346
Half1,913,836.5
Square14,651,080,594,929
Cube56,079,545,614,033,670,217
Square root1,956.44396802≈irrational, shown to 9 decimal places
Cube root156.426961533≈
Negation-3,827,673
Reciprocal2.61255337 × 10^-7≈
Representations
Decimal3,827,673
Binary111010011001111101100122 bits
Octal16463731
Hexadecimal3A67D9
Base 362A1G9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, eight hundred and twenty-seven thousand, six hundred and seventy-three
Ordinalthree million, eight hundred and twenty-seven thousand, six hundred and seventy-third
Scientific notation3.827673 × 10^6
Engineering notation3.827673 × 10^6
In other bases
Ternary21012110120200base 3; the most digit-efficient integer base after e: 14 digits
Quinary1434441143base 5; one hand: 10 digits
Septenary44351253base 7: 8 digits
Nonary7173520base 9; each digit is two ternary digits: 7 digits
Duodecimal1347109base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal13i93dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:43:14:33base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11TT111TT1T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011111011100000101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110100110011111011001
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 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
Bytes33a 67 d9
Gray code1001110101010000110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110100110011111011001
64-bit0000000000000000000000000000000000000000001110100110011111011001
One's complement11111111110001011001100000100110at 32 bits, every bit flipped
Bits reversed10011011111001100101110000000000at 32 bits
Rotated left by 100000000011101001100111110110010at 32 bits, wrapping
Shifted left by 111101001100111110110010= 7,655,346, no wrap
Shifted right by 1111010011001111101100= 1,913,836, discarding the low bit
These bits as a double1.89112173 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,827,673 to the power 214,651,080,594,929
3,827,673 to the power 356,079,545,614,033,670,217
3,827,673 to the power 4214,654,162,599,105,100,580,515,041
3,827,673 to the power 5821,625,942,518,204,417,654,321,748,529,593
First ten multiples3,827,673, 7,655,346, 11,483,019, 15,310,692, 19,138,365, 22,966,038, 26,793,711, 30,621,384, 34,449,057, 38,276,730
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 179the total stopping time
Highest value reached12,918,4003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,827,673 → 11,483,020 → 5,741,510 → 2,870,755 → 8,612,266 → 4,306,133 → 12,918,400 → 6,459,200 → 3,229,600 → 1,614,800 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage382,767,300%
3,827,673% as a decimal38,276.73
3,827,673% of 1003,827,673
3,827,673% of 1,00038,276,730
As a fraction of 1003,827,673/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,827,673
Nerdulate something else
Nothing in mind? Surprise me · today’s page