Recognised as Number
4,997,763
- Positive
- Odd
- Composite
- 7 digits
4,997,763 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,997,763
Digit count7
Digit sum45
Digit product285,768
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 555,307
Distinct prime factors23, 555,307
Number of divisors6
Sum of divisors σ(n)7,219,004
Aliquot sum2,221,241sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,331,836integers below n that share no factor with it
Carmichael function λ(n)555,306the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,331,836
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 555,307, 1,665,921, 4,997,7636 in total
Arithmetic
Previous number4,997,762
Next number4,997,764
Double9,995,526
Half2,498,881.5
Square24,977,635,004,169
Cube124,832,300,051,340,673,947
Square root2,235.567713132≈irrational, shown to 9 decimal places
Cube root170.972089422≈
Negation-4,997,763
Reciprocal2.0008952 × 10^-7≈
Representations
Decimal4,997,763
Binary1001100010000101000001123 bits
Octal23041203
Hexadecimal4C4283
Base 362Z4AR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, nine hundred and ninety-seven thousand, seven hundred and sixty-three
Ordinalfour million, nine hundred and ninety-seven thousand, seven hundred and sixty-third
Scientific notation4.997763 × 10^6
Engineering notation4.997763 × 10^6
In other bases
Ternary100101220122100base 3; the most digit-efficient integer base after e: 15 digits
Quinary2234412023base 5; one hand: 10 digits
Septenary60323511base 7: 8 digits
Nonary10356570base 9; each digit is two ternary digits: 8 digits
Duodecimal1810283base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1b4e83base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal23:8:16:3base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10011T0T1T0T100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111000100011110000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010011000100001010000011
Bit length23 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits15within that length
Bit parityeven8 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
Bytes34c 42 83
Gray code11010100110001111000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010011000100001010000011
64-bit0000000000000000000000000000000000000000010011000100001010000011
One's complement11111111101100111011110101111100at 32 bits, every bit flipped
Bits reversed11000001010000100011001000000000at 32 bits
Rotated left by 100000000100110001000010100000110at 32 bits, wrapping
Shifted left by 1100110001000010100000110= 9,995,526, no wrap
Shifted right by 11001100010000101000001= 2,498,881, discarding the low bit
These bits as a double2.469223 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,997,763 to the power 224,977,635,004,169
4,997,763 to the power 3124,832,300,051,340,673,947
4,997,763 to the power 4623,882,250,401,488,520,647,380,561
4,997,763 to the power 53,118,015,627,413,294,473,416,214,614,685,043
First ten multiples4,997,763, 9,995,526, 14,993,289, 19,991,052, 24,988,815, 29,986,578, 34,984,341, 39,982,104, 44,979,867, 49,977,630
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 3
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1131the total stopping time
Highest value reached22,489,9364× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,997,763 → 14,993,290 → 7,496,645 → 22,489,936 → 11,244,968 → 5,622,484 → 2,811,242 → 1,405,621 → 4,216,864 → 2,108,432 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage499,776,300%
4,997,763% as a decimal49,977.63
4,997,763% of 1004,997,763
4,997,763% of 1,00049,977,630
As a fraction of 1004,997,763/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,997,763
Nerdulate something else
Nothing in mind? Surprise me · today’s page