Recognised as Number
4,941,290
- Positive
- Even
- Composite
- 7 digits
4,941,290 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,941,290
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 5 × 494,129
Distinct prime factors32, 5, 494,129
Number of divisors8
Sum of divisors σ(n)8,894,340
Aliquot sum3,953,050sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,976,512integers below n that share no factor with it
Carmichael function λ(n)494,128the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,976,512
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 494,129, 988,258, 2,470,645, 4,941,2908 in total
Arithmetic
Previous number4,941,289
Next number4,941,291
Double9,882,580
Half2,470,645
Square24,416,346,864,100
Cube120,648,250,596,108,689,000
Square root2,222.901257366≈irrational, shown to 9 decimal places
Cube root170.325673279≈
Negation-4,941,290
Reciprocal2.02376303 × 10^-7≈
Representations
Decimal4,941,290
Binary1001011011001011110101023 bits
Octal22662752
Hexadecimal4B65EA
Base 362XWQ2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, nine hundred and forty-one thousand, two hundred and ninety
Ordinalfour million, nine hundred and forty-one thousand, two hundred and ninetieth
Scientific notation4.94129 × 10^6
Engineering notation4.94129 × 10^6
In other bases
Ternary100022001011202base 3; the most digit-efficient integer base after e: 15 digits
Quinary2231110130base 5; one hand: 10 digits
Septenary60000044base 7: 8 digits
Nonary10261152base 9; each digit is two ternary digits: 8 digits
Duodecimal17a3662base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1ahd4abase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal22:52:34:50base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10010T0011TTT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111001011101000111110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010010110110010111101010
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 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
Bytes34b 65 ea
Gray code11011101101011100011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010010110110010111101010
64-bit0000000000000000000000000000000000000000010010110110010111101010
One's complement11111111101101001001101000010101at 32 bits, every bit flipped
Bits reversed01010111101001101101001000000000at 32 bits
Rotated left by 100000000100101101100101111010100at 32 bits, wrapping
Shifted left by 1100101101100101111010100= 9,882,580, no wrap
Shifted right by 11001011011001011110101= 2,470,645, discarding the low bit
These bits as a double2.44132164 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,941,290 to the power 224,416,346,864,100
4,941,290 to the power 3120,648,250,596,108,689,000
4,941,290 to the power 4596,157,994,188,045,903,868,810,000
4,941,290 to the power 52,945,789,535,101,449,344,327,912,164,900,000
First ten multiples4,941,290, 9,882,580, 14,823,870, 19,765,160, 24,706,450, 29,647,740, 34,589,030, 39,530,320, 44,471,610, 49,412,900
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 4
Divisible by 8No, remainder 2
Divisible by 9No, remainder 2
Divisible by 10Yes
Divisible by 11No, remainder 2
Divisible by 12No, remainder 2
Divisible by 100No, remainder 90
Collatz (3n + 1) trajectory
Steps to reach 1118the total stopping time
Highest value reached7,411,9361× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,941,290 → 2,470,645 → 7,411,936 → 3,705,968 → 1,852,984 → 926,492 → 463,246 → 231,623 → 694,870 → 347,435 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage494,129,000%
4,941,290% as a decimal49,412.9
4,941,290% of 1004,941,290
4,941,290% of 1,00049,412,900
As a fraction of 1004,941,290/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,941,290
Nerdulate something else
Nothing in mind? Surprise me · today’s page