Recognised as Number

4,488,959

Positive
Odd
Composite
7 digits

4,488,959 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value4,488,959

Digit count7

Digit sum47

Digit product414,720

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation19 × 236,261

Distinct prime factors219, 236,261

Number of divisors4

Sum of divisors σ(n)4,725,240

Aliquot sum236,281sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)4,252,680integers below n that share no factor with it

Carmichael function λ(n)2,126,340the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,252,680

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

SquarefreeYesno repeated prime factor

All divisors1, 19, 236,261, 4,488,9594 in total

Arithmetic

Previous number4,488,958

Next number4,488,960

Double8,977,918

Half2,244,479.5

Square20,150,752,903,681

Cube90,455,903,603,754,958,079

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

Cube root164.961227498≈

Negation-4,488,959

Reciprocal2.22768798 × 10^-7≈

Representations

Decimal4,488,959

Binary1000100011111101111111123 bits

Octal21077377

Hexadecimal447EFF

Base 362O7PB

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

In wordsfour million, four hundred and eighty-eight thousand, nine hundred and fifty-nine

Ordinalfour million, four hundred and eighty-eight thousand, nine hundred and fifty-ninth

Scientific notation4.488959 × 10^6

Engineering notation4.488959 × 10^6

In other bases

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

Quinary2122121314base 5; one hand: 10 digits

Septenary53104226base 7: 8 digits

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

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

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

Sexagesimal20:46:55:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000010001000111111011111111

Bit length23 bitsto write the magnitude

Set bits16the population count, or Hamming weight

Zero bits7within that length

Bit parityeven16 set bits, so even; not the same as the number itself being odd

Highest set bitbit 22worth 4,194,304

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes344 7e ff

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

At each machine width

32-bit00000000010001000111111011111111

64-bit0000000000000000000000000000000000000000010001000111111011111111

One's complement11111111101110111000000100000000at 32 bits, every bit flipped

Bits reversed11111111011111100010001000000000at 32 bits

Rotated left by 100000000100010001111110111111110at 32 bits, wrapping

Shifted left by 1100010001111110111111110= 8,977,918, no wrap

Shifted right by 11000100011111101111111= 2,244,479, discarding the low bit

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

Nearest landmarks

Next prime4,488,961+2

Previous prime4,488,949−10

Distance to nearest prime2

Nearest square below4,485,924

Nearest square above4,490,161

Powers & multiples

4,488,959 to the power 220,150,752,903,681

4,488,959 to the power 390,455,903,603,754,958,079

4,488,959 to the power 4406,052,842,585,208,252,863,349,761

4,488,959 to the power 51,822,754,562,198,453,853,565,209,679,788,799

First ten multiples4,488,959, 8,977,918, 13,466,877, 17,955,836, 22,444,795, 26,933,754, 31,422,713, 35,911,672, 40,400,631, 44,889,590

Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 6

Divisible by 8No, remainder 7

Divisible by 9No, remainder 2

Divisible by 10No, remainder 9

Divisible by 11No, remainder 2

Divisible by 12No, remainder 11

Divisible by 100No, remainder 59

Collatz (3n + 1) trajectory

Steps to reach 1110the total stopping time

Highest value reached655,229,392145× the starting value

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

First steps4,488,959 → 13,466,878 → 6,733,439 → 20,200,318 → 10,100,159 → 30,300,478 → 15,150,239 → 45,450,718 → 22,725,359 → 68,176,078 → …

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

As a percentage & fraction

As a percentage448,895,900%

4,488,959% as a decimal44,889.59

4,488,959% of 1004,488,959

4,488,959% of 1,00044,889,590

As a fraction of 1004,488,959/100

Read another way

As seconds51 days, 22 hours and 55 minutes

As bytes4.281 MiB

As a 24-bit colour#447EFF

Keep nerding

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