Recognised as Number
4,161,241
- Positive
- Odd
- Composite
- 7 digits
4,161,241 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,161,241
Digit count7
Digit sum19
Digit product192
Multiplicative persistence3times 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 factorisation7 × 733 × 811
Distinct prime factors37, 733, 811
Number of divisors8
Sum of divisors σ(n)4,768,064
Aliquot sum606,823sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,557,520integers below n that share no factor with it
Carmichael function λ(n)98,820the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,557,520
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 733, 811, 5,131, 5,677, 594,463, 4,161,2418 in total
Arithmetic
Previous number4,161,240
Next number4,161,242
Double8,322,482
Half2,080,620.5
Square17,315,926,660,081
Cube72,055,743,970,922,120,521
Square root2,039.912007906≈irrational, shown to 9 decimal places
Cube root160.845021448≈
Negation-4,161,241
Reciprocal2.40312926 × 10^-7≈
Representations
Decimal4,161,241
Binary111111011111101101100122 bits
Octal17677331
Hexadecimal3F7ED9
Base 362H6U1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, one hundred and sixty-one thousand, two hundred and forty-one
Ordinalfour million, one hundred and sixty-one thousand, two hundred and forty-first
Scientific notation4.161241 × 10^6
Engineering notation4.161241 × 10^6
In other bases
Ternary21211102011001base 3; the most digit-efficient integer base after e: 14 digits
Quinary2031124431base 5; one hand: 10 digits
Septenary50240620base 7: 8 digits
Nonary7742131base 9; each digit is two ternary digits: 7 digits
Duodecimal1488161base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal160321base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:15:54:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT1111T011001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000001000001100101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111110111111011011001
Bit length22 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits5within that length
Bit parityodd17 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes33f 7e d9
Gray code1000001100000110110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111110111111011011001
64-bit0000000000000000000000000000000000000000001111110111111011011001
One's complement11111111110000001000000100100110at 32 bits, every bit flipped
Bits reversed10011011011111101111110000000000at 32 bits
Rotated left by 100000000011111101111110110110010at 32 bits, wrapping
Shifted left by 111111101111110110110010= 8,322,482, no wrap
Shifted right by 1111111011111101101100= 2,080,620, discarding the low bit
These bits as a double2.05592622 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,161,241 to the power 217,315,926,660,081
4,161,241 to the power 372,055,743,970,922,120,521
4,161,241 to the power 4299,841,316,097,303,935,718,926,561
4,161,241 to the power 51,247,711,978,038,061,126,774,961,681,622,201
First ten multiples4,161,241, 8,322,482, 12,483,723, 16,644,964, 20,806,205, 24,967,446, 29,128,687, 33,289,928, 37,451,169, 41,612,410
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
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 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1105the total stopping time
Highest value reached14,044,1923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,161,241 → 12,483,724 → 6,241,862 → 3,120,931 → 9,362,794 → 4,681,397 → 14,044,192 → 7,022,096 → 3,511,048 → 1,755,524 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage416,124,100%
4,161,241% as a decimal41,612.41
4,161,241% of 1004,161,241
4,161,241% of 1,00041,612,410
As a fraction of 1004,161,241/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 4,161,241
Nerdulate something else
Nothing in mind? Surprise me · today’s page