Recognised as Number
4,484,993
- Positive
- Odd
- Prime
- 7 digits
4,484,993 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,484,993
Digit count7
Digit sum41
Digit product124,416
Multiplicative persistence4times 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,484,993
Distinct prime factors14,484,993
Number of divisors2
Sum of divisors σ(n)4,484,994
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,484,992integers below n that share no factor with it
Carmichael function λ(n)4,484,992the 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,484,9932 in total
Arithmetic
Previous number4,484,992
Next number4,484,994
Double8,969,986
Half2,242,496.5
Square20,115,162,210,049
Cube90,216,361,705,934,294,657
Square root2,117.780205782≈irrational, shown to 9 decimal places
Cube root164.912632045≈
Negation-4,484,993
Reciprocal2.22965788 × 10^-7≈
Representations
Decimal4,484,993
Binary1000100011011111000000123 bits
Octal21067601
Hexadecimal446F81
Base 362O4N5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, four hundred and eighty-four thousand, nine hundred and ninety-three
Ordinalfour million, four hundred and eighty-four thousand, nine hundred and ninety-third
Scientific notation4.484993 × 10^6
Engineering notation4.484993 × 10^6
In other bases
Ternary22102212020212base 3; the most digit-efficient integer base after e: 14 digits
Quinary2122004433base 5; one hand: 10 digits
Septenary53056532base 7: 8 digits
Nonary8385225base 9; each digit is two ternary digits: 7 digits
Duodecimal1603595base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal180c9dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal20:45:49:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1100TT1T10TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001011011000010000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010001000110111110000001
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 6f 81
Gray code11001100101100001000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010001000110111110000001
64-bit0000000000000000000000000000000000000000010001000110111110000001
One's complement11111111101110111001000001111110at 32 bits, every bit flipped
Bits reversed10000001111101100010001000000000at 32 bits
Rotated left by 100000000100010001101111100000010at 32 bits, wrapping
Shifted left by 1100010001101111100000010= 8,969,986, no wrap
Shifted right by 11000100011011111000000= 2,242,496, discarding the low bit
These bits as a double2.21588096 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,484,993 to the power 220,115,162,210,049
4,484,993 to the power 390,216,361,705,934,294,657
4,484,993 to the power 4404,619,750,736,583,369,996,582,401
4,484,993 to the power 51,814,716,749,715,321,258,351,082,092,408,193
First ten multiples4,484,993, 8,969,986, 13,454,979, 17,939,972, 22,424,965, 26,909,958, 31,394,951, 35,879,944, 40,364,937, 44,849,930
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 93
Collatz (3n + 1) trajectory
Steps to reach 1211the total stopping time
Highest value reached13,454,9803× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,484,993 → 13,454,980 → 6,727,490 → 3,363,745 → 10,091,236 → 5,045,618 → 2,522,809 → 7,568,428 → 3,784,214 → 1,892,107 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage448,499,300%
4,484,993% as a decimal44,849.93
4,484,993% of 1004,484,993
4,484,993% of 1,00044,849,930
As a fraction of 1004,484,993/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,484,993
Nerdulate something else
Nothing in mind? Surprise me · today’s page