Recognised as Number
4,899,490
- Positive
- Even
- Composite
- 7 digits
4,899,490 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,899,490
Digit count7
Digit sum43
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 5 × 83 × 5,903
Distinct prime factors42, 5, 83, 5,903
Number of divisors16
Sum of divisors σ(n)8,926,848
Aliquot sum4,027,358sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,935,856integers below n that share no factor with it
Carmichael function λ(n)483,964the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,935,856
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 83, 166, 415, 830, 5,903, 11,806, 29,515, 59,030, 489,949, 979,898, 2,449,745, 4,899,49016 in total
Arithmetic
Previous number4,899,489
Next number4,899,491
Double9,798,980
Half2,449,745
Square24,005,002,260,100
Cube117,612,268,523,337,349,000
Square root2,213.479161863≈irrational, shown to 9 decimal places
Cube root169.844032267≈
Negation-4,899,490
Reciprocal2.04102876 × 10^-7≈
Representations
Decimal4,899,490
Binary1001010110000101010001023 bits
Octal22541242
Hexadecimal4AC2A2
Base 362X0GY
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, eight hundred and ninety-nine thousand, four hundred and ninety
Ordinalfour million, eight hundred and ninety-nine thousand, four hundred and ninetieth
Scientific notation4.89949 × 10^6
Engineering notation4.89949 × 10^6
In other bases
Ternary100012220211121base 3; the most digit-efficient integer base after e: 15 digits
Quinary2223240430base 5; one hand: 10 digits
Septenary56434141base 7: 8 digits
Nonary10186747base 9; each digit is two ternary digits: 8 digits
Duodecimal178342abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1ac8eabase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal22:40:58:10base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1001T00T10TTTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111111100011111100110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010010101100001010100010
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 even
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes34a c2 a2
Gray code11011111010001111110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010010101100001010100010
64-bit0000000000000000000000000000000000000000010010101100001010100010
One's complement11111111101101010011110101011101at 32 bits, every bit flipped
Bits reversed01000101010000110101001000000000at 32 bits
Rotated left by 100000000100101011000010101000100at 32 bits, wrapping
Shifted left by 1100101011000010101000100= 9,798,980, no wrap
Shifted right by 11001010110000101010001= 2,449,745, discarding the low bit
These bits as a double2.42066969 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,899,490 to the power 224,005,002,260,100
4,899,490 to the power 3117,612,268,523,337,349,000
4,899,490 to the power 4576,240,133,507,406,108,052,010,000
4,899,490 to the power 52,823,282,771,718,201,152,339,742,474,900,000
First ten multiples4,899,490, 9,798,980, 14,698,470, 19,597,960, 24,497,450, 29,396,940, 34,296,430, 39,195,920, 44,095,410, 48,994,900
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8No, remainder 2
Divisible by 9No, remainder 7
Divisible by 10Yes
Divisible by 11No, remainder 2
Divisible by 12No, remainder 10
Divisible by 100No, remainder 90
Collatz (3n + 1) trajectory
Steps to reach 1175the total stopping time
Highest value reached10,464,0642× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,899,490 → 2,449,745 → 7,349,236 → 3,674,618 → 1,837,309 → 5,511,928 → 2,755,964 → 1,377,982 → 688,991 → 2,066,974 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage489,949,000%
4,899,490% as a decimal48,994.9
4,899,490% of 1004,899,490
4,899,490% of 1,00048,994,900
As a fraction of 1004,899,490/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,899,490
Nerdulate something else
Nothing in mind? Surprise me · today’s page