Recognised as Number

4,148,946

Positive
Even
Composite
7 digits

4,148,946 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value4,148,946

Digit count7

Digit sum36

Digit product27,648

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3^2 × 53 × 4,349

Distinct prime factors42, 3, 53, 4,349

Number of divisors24

Sum of divisors σ(n)9,161,100

Aliquot sum5,012,154sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)169,572the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,356,576

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 6, 9, 18, 53, 106, 159, 318, 477, 954, 4,349, 8,698, 13,047, 26,094, 39,141, 78,282, 230,497, 460,994, 691,491, 1,382,982, 2,074,473, 4,148,94624 in total

Arithmetic

Previous number4,148,945

Next number4,148,947

Double8,297,892

Half2,074,473

Square17,213,752,910,916

Cube71,418,931,284,733,294,536

Square root2,036.896168193≈irrational, shown to 9 decimal places

Cube root160.68645173≈

Negation-4,148,946

Reciprocal2.4102507 × 10^-7≈

Representations

Decimal4,148,946

Binary111111010011101101001022 bits

Octal17647322

Hexadecimal3F4ED2

Base 362GXCI

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

In wordsfour million, one hundred and forty-eight thousand, nine hundred and forty-six

Ordinalfour million, one hundred and forty-eight thousand, nine hundred and forty-sixth

Scientific notation4.148946 × 10^6

Engineering notation4.148946 × 10^6

In other bases

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

Quinary2030231241base 5; one hand: 10 digits

Septenary50160024base 7: 8 digits

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

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

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

Sexagesimal19:12:29:6base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001111110100111011010010

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 even

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes33f 4e d2

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

At each machine width

32-bit00000000001111110100111011010010

64-bit0000000000000000000000000000000000000000001111110100111011010010

One's complement11111111110000001011000100101101at 32 bits, every bit flipped

Bits reversed01001011011100101111110000000000at 32 bits

Rotated left by 100000000011111101001110110100100at 32 bits, wrapping

Shifted left by 111111101001110110100100= 8,297,892, no wrap

Shifted right by 1111111010011101101001= 2,074,473, discarding the low bit

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

Nearest landmarks

Next prime4,148,953+7

Previous prime4,148,933−13

Distance to nearest prime7

Nearest square below4,145,296

Nearest square above4,149,369

Powers & multiples

4,148,946 to the power 217,213,752,910,916

4,148,946 to the power 371,418,931,284,733,294,536

4,148,946 to the power 4296,313,289,278,069,063,431,959,056

4,148,946 to the power 51,229,387,836,297,087,528,449,772,797,554,976

First ten multiples4,148,946, 8,297,892, 12,446,838, 16,595,784, 20,744,730, 24,893,676, 29,042,622, 33,191,568, 37,340,514, 41,489,460

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 5No, remainder 1

Divisible by 6Yes

Divisible by 7No, remainder 4

Divisible by 8No, remainder 2

Divisible by 9Yes

Divisible by 10No, remainder 6

Divisible by 11No, remainder 10

Divisible by 12No, remainder 6

Divisible by 100No, remainder 46

Collatz (3n + 1) trajectory

Steps to reach 1198the total stopping time

Highest value reached15,753,0403× the starting value

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

First steps4,148,946 → 2,074,473 → 6,223,420 → 3,111,710 → 1,555,855 → 4,667,566 → 2,333,783 → 7,001,350 → 3,500,675 → 10,502,026 → …

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

As a percentage & fraction

As a percentage414,894,600%

4,148,946% as a decimal41,489.46

4,148,946% of 1004,148,946

4,148,946% of 1,00041,489,460

As a fraction of 1004,148,946/100

Read another way

As seconds48 days, 29 minutes and 6 seconds

As bytes3.957 MiB

As a 24-bit colour#3F4ED2

Keep nerding

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