Recognised as Number
4,491,667
- Positive
- Odd
- Prime
- 7 digits
4,491,667 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,491,667
Digit count7
Digit sum37
Digit product36,288
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 factorisation4,491,667
Distinct prime factors14,491,667
Number of divisors2
Sum of divisors σ(n)4,491,668
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,491,666integers below n that share no factor with it
Carmichael function λ(n)4,491,666the 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,6672 in total
Arithmetic
Previous number4,491,666
Next number4,491,668
Double8,983,334
Half2,245,833.5
Square20,175,072,438,889
Cube90,619,707,096,367,237,963
Square root2,119.355326509≈irrational, shown to 9 decimal places
Cube root164.994392218≈
Negation-4,491,667
Reciprocal2.22634492 × 10^-7≈
Representations
Decimal4,491,667
Binary1000100100010011001001123 bits
Octal21104623
Hexadecimal448993
Base 362O9SJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, four hundred and ninety-one thousand, six hundred and sixty-seven
Ordinalfour million, four hundred and ninety-one thousand, six hundred and sixty-seventh
Scientific notation4.491667 × 10^6
Engineering notation4.491667 × 10^6
In other bases
Ternary22110012102001base 3; the most digit-efficient integer base after e: 14 digits
Quinary2122213132base 5; one hand: 10 digits
Septenary53115145base 7: 8 digits
Nonary8405361base 9; each digit is two ternary digits: 7 digits
Duodecimal1607417base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal181937base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal20:47:41:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1101TT11T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001011001111010010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010001001000100110010011
Bit length23 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits14within that length
Bit parityodd9 set bits, so odd; 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 93
Gray code11001101100110101011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010001001000100110010011
64-bit0000000000000000000000000000000000000000010001001000100110010011
One's complement11111111101110110111011001101100at 32 bits, every bit flipped
Bits reversed11001001100100010010001000000000at 32 bits
Rotated left by 100000000100010010001001100100110at 32 bits, wrapping
Shifted left by 1100010010001001100100110= 8,983,334, no wrap
Shifted right by 11000100100010011001001= 2,245,833, discarding the low bit
These bits as a double2.21917836 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,491,667 to the power 220,175,072,438,889
4,491,667 to the power 390,619,707,096,367,237,963
4,491,667 to the power 4407,033,547,914,418,542,639,554,321
4,491,667 to the power 51,828,259,155,060,112,592,162,179,038,343,107
First ten multiples4,491,667, 8,983,334, 13,475,001, 17,966,668, 22,458,335, 26,950,002, 31,441,669, 35,933,336, 40,425,003, 44,916,670
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 187the total stopping time
Highest value reached20,212,5044× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,491,667 → 13,475,002 → 6,737,501 → 20,212,504 → 10,106,252 → 5,053,126 → 2,526,563 → 7,579,690 → 3,789,845 → 11,369,536 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage449,166,700%
4,491,667% as a decimal44,916.67
4,491,667% of 1004,491,667
4,491,667% of 1,00044,916,670
As a fraction of 1004,491,667/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,491,667
Nerdulate something else
Nothing in mind? Surprise me · today’s page