Recognised as Number
4,964,489
- Positive
- Odd
- Prime
- 7 digits
4,964,489 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,964,489
Digit count7
Digit sum44
Digit product248,832
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,964,489
Distinct prime factors14,964,489
Number of divisors2
Sum of divisors σ(n)4,964,490
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,964,488integers below n that share no factor with it
Carmichael function λ(n)4,964,488the 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,964,4892 in total
Arithmetic
Previous number4,964,488
Next number4,964,490
Double9,928,978
Half2,482,244.5
Square24,646,151,031,121
Cube122,355,545,686,338,862,169
Square root2,228.113327459≈irrational, shown to 9 decimal places
Cube root170.591812792≈
Negation-4,964,489
Reciprocal2.014306 × 10^-7≈
Representations
Decimal4,964,489
Binary1001011110000001000100123 bits
Octal22740211
Hexadecimal4BC089
Base 362YEMH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, nine hundred and sixty-four thousand, four hundred and eighty-nine
Ordinalfour million, nine hundred and sixty-four thousand, four hundred and eighty-ninth
Scientific notation4.964489 × 10^6
Engineering notation4.964489 × 10^6
In other bases
Ternary100100012222222base 3; the most digit-efficient integer base after e: 15 digits
Quinary2232330424base 5; one hand: 10 digits
Septenary60124505base 7: 8 digits
Nonary10305888base 9; each digit is two ternary digits: 8 digits
Duodecimal17b4b75base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1b0b49base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal22:59:1:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1001001T000000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111001100000110011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010010111100000010001001
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
Bytes34b c0 89
Gray code11011100010000011001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010010111100000010001001
64-bit0000000000000000000000000000000000000000010010111100000010001001
One's complement11111111101101000011111101110110at 32 bits, every bit flipped
Bits reversed10010001000000111101001000000000at 32 bits
Rotated left by 100000000100101111000000100010010at 32 bits, wrapping
Shifted left by 1100101111000000100010010= 9,928,978, no wrap
Shifted right by 11001011110000001000100= 2,482,244, discarding the low bit
These bits as a double2.45278346 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,964,489 to the power 224,646,151,031,121
4,964,489 to the power 3122,355,545,686,338,862,169
4,964,489 to the power 4607,432,760,648,826,731,510,516,641
4,964,489 to the power 53,015,593,258,480,733,171,489,913,248,561,449
First ten multiples4,964,489, 9,928,978, 14,893,467, 19,857,956, 24,822,445, 29,786,934, 34,751,423, 39,715,912, 44,680,401, 49,644,890
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1175the total stopping time
Highest value reached63,617,23612× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,964,489 → 14,893,468 → 7,446,734 → 3,723,367 → 11,170,102 → 5,585,051 → 16,755,154 → 8,377,577 → 25,132,732 → 12,566,366 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage496,448,900%
4,964,489% as a decimal49,644.89
4,964,489% of 1004,964,489
4,964,489% of 1,00049,644,890
As a fraction of 1004,964,489/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,964,489
Nerdulate something else
Nothing in mind? Surprise me · today’s page