Recognised as Number

3,801,075

Positive
Odd
Composite
7 digits

3,801,075 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value3,801,075

Digit count7

Digit sum24

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 5^2 × 59 × 859

Distinct prime factors43, 5, 59, 859

Number of divisors24

Sum of divisors σ(n)6,398,400

Aliquot sum2,597,325sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,990,560integers below n that share no factor with it

Carmichael function λ(n)248,820the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,990,560

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 5, 15, 25, 59, 75, 177, 295, 859, 885, 1,475, 2,577, 4,295, 4,425, 12,885, 21,475, 50,681, 64,425, 152,043, 253,405, 760,215, 1,267,025, 3,801,07524 in total

Arithmetic

Previous number3,801,074

Next number3,801,076

Double7,602,150

Half1,900,537.5

Square14,448,171,155,625

Cube54,918,582,175,367,296,875

Square root1,949.634581146≈irrational, shown to 9 decimal places

Cube root156.063788837≈

Negation-3,801,075

Reciprocal2.6308347 × 10^-7≈

Representations

Decimal3,801,075

Binary111001111111111111001122 bits

Octal16377763

Hexadecimal39FFF3

Base 3629GXF

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsthree million, eight hundred and one thousand and seventy-five

Ordinalthree million, eight hundred and one thousand and seventy-fifth

Scientific notation3.801075 × 10^6

Engineering notation3.801075 × 10^6

In other bases

Ternary21011010002120base 3; the most digit-efficient integer base after e: 14 digits

Quinary1433113300base 5; one hand: 10 digits

Septenary44210565base 7: 8 digits

Nonary7133076base 9; each digit is two ternary digits: 7 digits

Duodecimal1333843base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits

Vigesimal13f2dfbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal17:35:51:15base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T1011010010TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary10011100000000000110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001110011111111111110011

Bit length22 bitsto write the magnitude

Set bits18the population count, or Hamming weight

Zero bits4within that length

Bit parityeven18 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

Bytes339 ff f3

Gray code1001010000000000001010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001110011111111111110011

64-bit0000000000000000000000000000000000000000001110011111111111110011

One's complement11111111110001100000000000001100at 32 bits, every bit flipped

Bits reversed11001111111111111001110000000000at 32 bits

Rotated left by 100000000011100111111111111100110at 32 bits, wrapping

Shifted left by 111100111111111111100110= 7,602,150, no wrap

Shifted right by 1111001111111111111001= 1,900,537, discarding the low bit

These bits as a double1.87798057 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,801,097+22

Previous prime3,801,073−2

Distance to nearest prime2

Nearest square below3,798,601

Nearest square above3,802,500

Powers & multiples

3,801,075 to the power 214,448,171,155,625

3,801,075 to the power 354,918,582,175,367,296,875

3,801,075 to the power 4208,749,649,742,234,247,969,140,625

3,801,075 to the power 5793,473,074,893,963,044,099,301,201,171,875

First ten multiples3,801,075, 7,602,150, 11,403,225, 15,204,300, 19,005,375, 22,806,450, 26,607,525, 30,408,600, 34,209,675, 38,010,750

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 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 3

Divisible by 9No, remainder 6

Divisible by 10No, remainder 5

Divisible by 11No, remainder 3

Divisible by 12No, remainder 3

Divisible by 100No, remainder 75

Collatz (3n + 1) trajectory

Steps to reach 1154the total stopping time

Highest value reached17,104,8404× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps3,801,075 → 11,403,226 → 5,701,613 → 17,104,840 → 8,552,420 → 4,276,210 → 2,138,105 → 6,414,316 → 3,207,158 → 1,603,579 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage380,107,500%

3,801,075% as a decimal38,010.75

3,801,075% of 1003,801,075

3,801,075% of 1,00038,010,750

As a fraction of 1003,801,075/100

Read another way

As seconds43 days, 23 hours and 51 minutes

As bytes3.625 MiB

As a 24-bit colour#39FFF3

Keep nerding

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