Nerdulator> put something in

Recognised as Number

3,840,150

  • Positive
  • Even
  • Composite
  • 7 digits

3,840,150 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,840,150
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 numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 5^2 × 25,601
Distinct prime factors42, 3, 5, 25,601
Number of divisors24
Sum of divisors σ(n)9,523,944
Aliquot sum5,683,794sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,024,000integers below n that share no factor with it
Carmichael function λ(n)25,600the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,024,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 25,601, 51,202, 76,803, 128,005, 153,606, 256,010, 384,015, 640,025, 768,030, 1,280,050, 1,920,075, 3,840,15024 in total

Arithmetic

Previous number3,840,149
Next number3,840,151
Double7,680,300
Cube56,629,739,779,203,375,000
Square root1,959.63006713≈irrational, shown to 9 decimal places
Cube root156.596744614≈
Negation-3,840,150
Reciprocal2.60406495 × 10^-7≈

Representations

Decimal3,840,150
Binary111010100110001001011022 bits
Octal16514226
Hexadecimal3A9896
Base 362AB2U
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, eight hundred and forty thousand, one hundred and fifty
Ordinalthree million, eight hundred and forty thousand, one hundred and fiftieth
Scientific notation3.84015 × 10^6
Engineering notation3.84015 × 10^6

In other bases

Ternary21020002200210base 3; the most digit-efficient integer base after e: 14 digits
Quinary1440341100base 5; one hand: 10 digits
Septenary44432526base 7: 8 digits
Nonary7202623base 9; each digit is two ternary digits: 7 digits
Duodecimal1352386base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14007abase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:46:42:30base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11T0010T01T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011111110100111101010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001110101001100010010110
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 even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes33a 98 96
Gray code1001111101010011011101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001110101001100010010110
64-bit0000000000000000000000000000000000000000001110101001100010010110
One's complement11111111110001010110011101101001at 32 bits, every bit flipped
Bits reversed01101001000110010101110000000000at 32 bits
Rotated left by 100000000011101010011000100101100at 32 bits, wrapping
Shifted left by 111101010011000100101100= 7,680,300, no wrap
Shifted right by 1111010100110001001011= 1,920,075, discarding the low bit
These bits as a double1.89728619 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,840,157+7
Previous prime3,840,139−11
Distance to nearest prime7
Nearest square below3,837,681
Nearest square above3,841,600

Powers & multiples

3,840,150 to the power 214,746,752,022,500
3,840,150 to the power 356,629,739,779,203,375,000
3,840,150 to the power 4217,466,695,213,107,840,506,250,000
3,840,150 to the power 5835,104,729,622,616,073,720,075,937,500,000
First ten multiples3,840,150, 7,680,300, 11,520,450, 15,360,600, 19,200,750, 23,040,900, 26,881,050, 30,721,200, 34,561,350, 38,401,500
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10Yes
Divisible by 11No, remainder 6
Divisible by 12No, remainder 6
Divisible by 100No, remainder 50

Collatz (3n + 1) trajectory

Steps to reach 171the total stopping time
Highest value reached8,640,3402× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,840,150 → 1,920,075 → 5,760,226 → 2,880,113 → 8,640,340 → 4,320,170 → 2,160,085 → 6,480,256 → 3,240,128 → 1,620,064 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage384,015,000%
3,840,150% as a decimal38,401.5
3,840,150% of 1003,840,150
3,840,150% of 1,00038,401,500
As a fraction of 1003,840,150/100

Read another way

As bytes3.662 MiB
As a 24-bit colour#3A9896

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “3840150” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.