Recognised as Number

3,052,198

Positive
Even
Composite
7 digits

3,052,198 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value3,052,198

Digit count7

Digit sum28

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 19 × 31 × 2,591

Distinct prime factors42, 19, 31, 2,591

Number of divisors16

Sum of divisors σ(n)4,976,640

Aliquot sum1,924,442sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)23,310the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,398,600

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 19, 31, 38, 62, 589, 1,178, 2,591, 5,182, 49,229, 80,321, 98,458, 160,642, 1,526,099, 3,052,19816 in total

Arithmetic

Previous number3,052,197

Next number3,052,199

Double6,104,396

Half1,526,099

Square9,315,912,631,204

Cube28,434,009,901,135,586,392

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

Cube root145.056624733≈

Negation-3,052,198

Reciprocal3.27632742 × 10^-7≈

Representations

Decimal3,052,198

Binary101110100100101010011022 bits

Octal13511246

Hexadecimal2E92A6

Base 361TF3A

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

In wordsthree million, fifty-two thousand, one hundred and ninety-eight

Ordinalthree million, fifty-two thousand, one hundred and ninety-eighth

Scientific notation3.052198 × 10^6

Engineering notation3.052198 × 10^6

In other bases

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

Quinary1240132243base 5; one hand: 10 digits

Septenary34641352base 7: 8 digits

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

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

Vigesimalj1a9ibase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal14:7:49:58base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001011101001001010100110

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

Bytes32e 92 a6

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

At each machine width

32-bit00000000001011101001001010100110

64-bit0000000000000000000000000000000000000000001011101001001010100110

One's complement11111111110100010110110101011001at 32 bits, every bit flipped

Bits reversed01100101010010010111010000000000at 32 bits

Rotated left by 100000000010111010010010101001100at 32 bits, wrapping

Shifted left by 110111010010010101001100= 6,104,396, no wrap

Shifted right by 1101110100100101010011= 1,526,099, discarding the low bit

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

Nearest landmarks

Next prime3,052,211+13

Previous prime3,052,193−5

Distance to nearest prime5

Nearest square below3,052,009

Nearest square above3,055,504

Powers & multiples

3,052,198 to the power 29,315,912,631,204

3,052,198 to the power 328,434,009,901,135,586,392

3,052,198 to the power 486,786,228,152,226,234,514,489,616

3,052,198 to the power 5264,888,751,993,768,608,532,656,176,975,968

First ten multiples3,052,198, 6,104,396, 9,156,594, 12,208,792, 15,260,990, 18,313,188, 21,365,386, 24,417,584, 27,469,782, 30,521,980

Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5No, remainder 3

Divisible by 6No, remainder 4

Divisible by 7No, remainder 2

Divisible by 8No, remainder 6

Divisible by 9No, remainder 1

Divisible by 10No, remainder 8

Divisible by 11No, remainder 6

Divisible by 12No, remainder 10

Divisible by 100No, remainder 98

Collatz (3n + 1) trajectory

Steps to reach 1133the total stopping time

Highest value reached27,844,6129× the starting value

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

First steps3,052,198 → 1,526,099 → 4,578,298 → 2,289,149 → 6,867,448 → 3,433,724 → 1,716,862 → 858,431 → 2,575,294 → 1,287,647 → …

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

As a percentage & fraction

As a percentage305,219,800%

3,052,198% as a decimal30,521.98

3,052,198% of 1003,052,198

3,052,198% of 1,00030,521,980

As a fraction of 1003,052,198/100

Read another way

As seconds35 days, 7 hours and 49 minutes

As bytes2.911 MiB

As a 24-bit colour#2E92A6

Keep nerding

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