Recognised as Number
4,166,501
- Positive
- Odd
- Prime
- 7 digits
4,166,501 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,166,501
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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,166,501
Distinct prime factors14,166,501
Number of divisors2
Sum of divisors σ(n)4,166,502
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,166,500integers below n that share no factor with it
Carmichael function λ(n)4,166,500the 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,166,5012 in total
Arithmetic
Previous number4,166,500
Next number4,166,502
Double8,333,002
Half2,083,250.5
Square17,359,730,583,001
Cube72,329,334,833,804,249,501
Square root2,041.200872036≈irrational, shown to 9 decimal places
Cube root160.912764747≈
Negation-4,166,501
Reciprocal2.40009543 × 10^-7≈
Representations
Decimal4,166,501
Binary111111100100110110010122 bits
Octal17711545
Hexadecimal3F9365
Base 362HAW5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, one hundred and sixty-six thousand, five hundred and one
Ordinalfour million, one hundred and sixty-six thousand, five hundred and first
Scientific notation4.166501 × 10^6
Engineering notation4.166501 × 10^6
In other bases
Ternary21211200100212base 3; the most digit-efficient integer base after e: 14 digits
Quinary2031312001base 5; one hand: 10 digits
Septenary50262143base 7: 8 digits
Nonary7750325base 9; each digit is two ternary digits: 7 digits
Duodecimal148b205base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal160g51base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:17:21:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0TTT001010TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000001001010010100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111111001001101100101
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 odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes33f 93 65
Gray code1000000101101011010111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111111001001101100101
64-bit0000000000000000000000000000000000000000001111111001001101100101
One's complement11111111110000000110110010011010at 32 bits, every bit flipped
Bits reversed10100110110010011111110000000000at 32 bits
Rotated left by 100000000011111110010011011001010at 32 bits, wrapping
Shifted left by 111111110010011011001010= 8,333,002, no wrap
Shifted right by 1111111100100110110010= 2,083,250, discarding the low bit
These bits as a double2.05852501 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,166,501 to the power 217,359,730,583,001
4,166,501 to the power 372,329,334,833,804,249,501
4,166,501 to the power 4301,360,245,914,380,239,350,166,001
4,166,501 to the power 51,255,617,765,962,511,181,632,705,993,332,501
First ten multiples4,166,501, 8,333,002, 12,499,503, 16,666,004, 20,832,505, 24,999,006, 29,165,507, 33,332,008, 37,498,509, 41,665,010
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 179the total stopping time
Highest value reached12,499,5043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,166,501 → 12,499,504 → 6,249,752 → 3,124,876 → 1,562,438 → 781,219 → 2,343,658 → 1,171,829 → 3,515,488 → 1,757,744 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage416,650,100%
4,166,501% as a decimal41,665.01
4,166,501% of 1004,166,501
4,166,501% of 1,00041,665,010
As a fraction of 1004,166,501/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,166,501
Nerdulate something else
Nothing in mind? Surprise me · today’s page