Nerdulator> put something in

Recognised as Number

4,421,041

  • Positive
  • Odd
  • Prime
  • 7 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,421,041
Digit count7
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation4,421,041
Distinct prime factors14,421,041
Number of divisors2
Sum of divisors σ(n)4,421,042
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,421,040integers below n that share no factor with it
Carmichael function λ(n)4,421,040the 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,421,0412 in total

Arithmetic

Previous number4,421,040
Next number4,421,042
Double8,842,082
Cube86,411,914,547,938,171,921
Square root2,102.62716619≈irrational, shown to 9 decimal places
Cube root164.125040967≈
Negation-4,421,041
Reciprocal2.26191071 × 10^-7≈

Representations

Decimal4,421,041
Binary1000011011101011011000123 bits
Octal20672661
Hexadecimal4375B1
Base 362MRAP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, four hundred and twenty-one thousand and forty-one
Ordinalfour million, four hundred and twenty-one thousand and forty-first
Scientific notation4.421041 × 10^6
Engineering notation4.421041 × 10^6

In other bases

Ternary22022121112021base 3; the most digit-efficient integer base after e: 14 digits
Quinary2112433131base 5; one hand: 10 digits
Septenary52402222base 7: 8 digits
Nonary8277467base 9; each digit is two ternary digits: 7 digits
Duodecimal1592581base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal17ccc1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal20:28:4:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T100T0TTTT1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001001000101011110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010000110111010110110001
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 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
Bytes343 75 b1
Gray code11000101100111101101001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010000110111010110110001
64-bit0000000000000000000000000000000000000000010000110111010110110001
One's complement11111111101111001000101001001110at 32 bits, every bit flipped
Bits reversed10001101101011101100001000000000at 32 bits
Rotated left by 100000000100001101110101101100010at 32 bits, wrapping
Shifted left by 1100001101110101101100010= 8,842,082, no wrap
Shifted right by 11000011011101011011000= 2,210,520, discarding the low bit
These bits as a double2.18428448 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,421,063+22
Previous prime4,421,033−8
Distance to nearest prime0, it is prime
Nearest square below4,418,404
Nearest square above4,422,609

Powers & multiples

4,421,041 to the power 219,545,603,523,681
4,421,041 to the power 386,411,914,547,938,171,921
4,421,041 to the power 4382,030,617,104,931,123,527,789,761
4,421,041 to the power 51,688,973,021,476,201,799,292,423,172,761,201
First ten multiples4,421,041, 8,842,082, 13,263,123, 17,684,164, 22,105,205, 26,526,246, 30,947,287, 35,368,328, 39,789,369, 44,210,410
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 174the total stopping time
Highest value reached13,263,1243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,421,041 → 13,263,124 → 6,631,562 → 3,315,781 → 9,947,344 → 4,973,672 → 2,486,836 → 1,243,418 → 621,709 → 1,865,128 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage442,104,100%
4,421,041% as a decimal44,210.41
4,421,041% of 1004,421,041
4,421,041% of 1,00044,210,410
As a fraction of 1004,421,041/100

Read another way

As bytes4.216 MiB
As a 24-bit colour#4375B1

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “4421041” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.