Recognised as Number

4,491,671

Positive
Odd
Prime
7 digits

4,491,671 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value4,491,671

Digit count7

Digit sum32

Digit product6,048

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation4,491,671

Distinct prime factors14,491,671

Number of divisors2

Sum of divisors σ(n)4,491,672

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)4,491,670the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 4,491,6712 in total

Arithmetic

Previous number4,491,670

Next number4,491,672

Double8,983,342

Half2,245,835.5

Square20,175,108,372,241

Cube90,619,949,197,452,104,711

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

Cube root164.994441196≈

Negation-4,491,671

Reciprocal2.22634294 × 10^-7≈

Representations

Decimal4,491,671

Binary1000100100010011001011123 bits

Octal21104627

Hexadecimal448997

Base 362O9SN

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

In wordsfour million, four hundred and ninety-one thousand, six hundred and seventy-one

Ordinalfour million, four hundred and ninety-one thousand, six hundred and seventy-first

Scientific notation4.491671 × 10^6

Engineering notation4.491671 × 10^6

In other bases

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

Quinary2122213141base 5; one hand: 10 digits

Septenary53115152base 7: 8 digits

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

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

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

Sexagesimal20:47:41:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000010001001000100110010111

Bit length23 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits13within that length

Bit parityeven10 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 89 97

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

At each machine width

32-bit00000000010001001000100110010111

64-bit0000000000000000000000000000000000000000010001001000100110010111

One's complement11111111101110110111011001101000at 32 bits, every bit flipped

Bits reversed11101001100100010010001000000000at 32 bits

Rotated left by 100000000100010010001001100101110at 32 bits, wrapping

Shifted left by 1100010010001001100101110= 8,983,342, no wrap

Shifted right by 11000100100010011001011= 2,245,835, discarding the low bit

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

Nearest landmarks

Next prime4,491,677+6

Previous prime4,491,667−4

Distance to nearest prime0, it is prime

Nearest square below4,490,161

Nearest square above4,494,400

Powers & multiples

4,491,671 to the power 220,175,108,372,241

4,491,671 to the power 390,619,949,197,452,104,711

4,491,671 to the power 4407,034,997,831,668,892,619,362,081

4,491,671 to the power 51,828,267,295,745,570,046,580,502,697,727,351

First ten multiples4,491,671, 8,983,342, 13,475,013, 17,966,684, 22,458,355, 26,950,026, 31,441,697, 35,933,368, 40,425,039, 44,916,710

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 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 7

Divisible by 9No, remainder 5

Divisible by 10No, remainder 1

Divisible by 11No, remainder 8

Divisible by 12No, remainder 11

Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 187the total stopping time

Highest value reached30,318,7846× the starting value

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

First steps4,491,671 → 13,475,014 → 6,737,507 → 20,212,522 → 10,106,261 → 30,318,784 → 15,159,392 → 7,579,696 → 3,789,848 → 1,894,924 → …

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

As a percentage & fraction

As a percentage449,167,100%

4,491,671% as a decimal44,916.71

4,491,671% of 1004,491,671

4,491,671% of 1,00044,916,710

As a fraction of 1004,491,671/100

Read another way

As seconds51 days, 23 hours and 41 minutes

As bytes4.284 MiB

As a 24-bit colour#448997

Keep nerding

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