Recognised as Number
4,949,753
- Positive
- Odd
- Prime
- 7 digits
4,949,753 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,949,753
Digit count7
Digit sum41
Digit product136,080
Multiplicative persistence2times 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,949,753
Distinct prime factors14,949,753
Number of divisors2
Sum of divisors σ(n)4,949,754
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,949,752integers below n that share no factor with it
Carmichael function λ(n)4,949,752the 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,949,7532 in total
Arithmetic
Previous number4,949,752
Next number4,949,754
Double9,899,506
Half2,474,876.5
Square24,500,054,761,009
Cube121,269,219,553,468,580,777
Square root2,224.804036314≈irrational, shown to 9 decimal places
Cube root170.422857349≈
Negation-4,949,753
Reciprocal2.02030283 × 10^-7≈
Representations
Decimal4,949,753
Binary1001011100001101111100123 bits
Octal22703371
Hexadecimal4B86F9
Base 362Y395
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, nine hundred and forty-nine thousand, seven hundred and fifty-three
Ordinalfour million, nine hundred and forty-nine thousand, seven hundred and fifty-third
Scientific notation4.949753 × 10^6
Engineering notation4.949753 × 10^6
In other bases
Ternary100022110210012base 3; the most digit-efficient integer base after e: 15 digits
Quinary2231343003base 5; one hand: 10 digits
Septenary60033524base 7: 8 digits
Nonary10273705base 9; each digit is two ternary digits: 8 digits
Duodecimal17a8535base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1aie7dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal22:54:55:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10010T111T101TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111001001101100001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010010111000011011111001
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 odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes34b 86 f9
Gray code11011100100010110000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010010111000011011111001
64-bit0000000000000000000000000000000000000000010010111000011011111001
One's complement11111111101101000111100100000110at 32 bits, every bit flipped
Bits reversed10011111011000011101001000000000at 32 bits
Rotated left by 100000000100101110000110111110010at 32 bits, wrapping
Shifted left by 1100101110000110111110010= 9,899,506, no wrap
Shifted right by 11001011100001101111100= 2,474,876, discarding the low bit
These bits as a double2.44550291 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,949,753 to the power 224,500,054,761,009
4,949,753 to the power 3121,269,219,553,468,580,777
4,949,753 to the power 4600,252,683,292,439,768,106,698,081
4,949,753 to the power 52,971,102,519,884,803,619,505,433,146,523,993
First ten multiples4,949,753, 9,899,506, 14,849,259, 19,799,012, 24,748,765, 29,698,518, 34,648,271, 39,598,024, 44,547,777, 49,497,530
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 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 53
Collatz (3n + 1) trajectory
Steps to reach 1175the total stopping time
Highest value reached18,793,6003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,949,753 → 14,849,260 → 7,424,630 → 3,712,315 → 11,136,946 → 5,568,473 → 16,705,420 → 8,352,710 → 4,176,355 → 12,529,066 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage494,975,300%
4,949,753% as a decimal49,497.53
4,949,753% of 1004,949,753
4,949,753% of 1,00049,497,530
As a fraction of 1004,949,753/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,949,753
Nerdulate something else
Nothing in mind? Surprise me · today’s page