Recognised as Number
3,840,123
- Positive
- Odd
- Composite
- 7 digits
3,840,123 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,840,123
Digit count7
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 7 × 107 × 1,709
Distinct prime factors43, 7, 107, 1,709
Number of divisors16
Sum of divisors σ(n)5,909,760
Aliquot sum2,069,637sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,172,576integers below n that share no factor with it
Carmichael function λ(n)271,572the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,172,576
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 21, 107, 321, 749, 1,709, 2,247, 5,127, 11,963, 35,889, 182,863, 548,589, 1,280,041, 3,840,12316 in total
Arithmetic
Previous number3,840,122
Next number3,840,124
Double7,680,246
Half1,920,061.5
Square14,746,544,655,129
Cube56,628,545,300,687,940,867
Square root1,959.623178063≈irrational, shown to 9 decimal places
Cube root156.596377604≈
Negation-3,840,123
Reciprocal2.60408325 × 10^-7≈
Representations
Decimal3,840,123
Binary111010100110000111101122 bits
Octal16514173
Hexadecimal3A987B
Base 362AB23
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, eight hundred and forty thousand, one hundred and twenty-three
Ordinalthree million, eight hundred and forty thousand, one hundred and twenty-third
Scientific notation3.840123 × 10^6
Engineering notation3.840123 × 10^6
In other bases
Ternary21020002122210base 3; the most digit-efficient integer base after e: 14 digits
Quinary1440340443base 5; one hand: 10 digits
Septenary44432460base 7: 8 digits
Nonary7202583base 9; each digit is two ternary digits: 7 digits
Duodecimal1352363base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal140063base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:46:42:3base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11T0010T00T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011111110100110001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110101001100001111011
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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
Bytes33a 98 7b
Gray code1001111101010001000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110101001100001111011
64-bit0000000000000000000000000000000000000000001110101001100001111011
One's complement11111111110001010110011110000100at 32 bits, every bit flipped
Bits reversed11011110000110010101110000000000at 32 bits
Rotated left by 100000000011101010011000011110110at 32 bits, wrapping
Shifted left by 111101010011000011110110= 7,680,246, no wrap
Shifted right by 1111010100110000111101= 1,920,061, discarding the low bit
These bits as a double1.89727285 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,840,123 to the power 214,746,544,655,129
3,840,123 to the power 356,628,545,300,687,940,867
3,840,123 to the power 4217,460,579,265,713,677,546,006,641
3,840,123 to the power 5835,075,372,031,590,204,559,003,660,256,843
First ten multiples3,840,123, 7,680,246, 11,520,369, 15,360,492, 19,200,615, 23,040,738, 26,880,861, 30,720,984, 34,561,107, 38,401,230
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 3
Divisible by 100No, remainder 23
Collatz (3n + 1) trajectory
Steps to reach 1123the total stopping time
Highest value reached27,680,1287× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,840,123 → 11,520,370 → 5,760,185 → 17,280,556 → 8,640,278 → 4,320,139 → 12,960,418 → 6,480,209 → 19,440,628 → 9,720,314 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage384,012,300%
3,840,123% as a decimal38,401.23
3,840,123% of 1003,840,123
3,840,123% of 1,00038,401,230
As a fraction of 1003,840,123/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,840,123
Nerdulate something else
Nothing in mind? Surprise me · today’s page