Recognised as Number
5,116,746
- Positive
- Even
- Composite
- 7 digits
5,116,746 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value5,116,746
Digit count7
Digit sum30
Digit product5,040
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 499 × 1,709
Distinct prime factors42, 3, 499, 1,709
Number of divisors16
Sum of divisors σ(n)10,260,000
Aliquot sum5,143,254sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,701,168integers below n that share no factor with it
Carmichael function λ(n)425,292the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,701,168
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 499, 998, 1,497, 1,709, 2,994, 3,418, 5,127, 10,254, 852,791, 1,705,582, 2,558,373, 5,116,74616 in total
Arithmetic
Previous number5,116,745
Next number5,116,747
Double10,233,492
Half2,558,373
Square26,181,089,628,516
Cube133,961,985,632,350,728,936
Square root2,262.022546307≈irrational, shown to 9 decimal places
Cube root172.318254285≈
Negation-5,116,746
Reciprocal1.95436709 × 10^-7≈
Representations
Decimal5,116,746
Binary1001110000100110100101023 bits
Octal23411512
Hexadecimal4E134A
Base 3631O3U
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, one hundred and sixteen thousand, seven hundred and forty-six
Ordinalfive million, one hundred and sixteen thousand, seven hundred and forty-sixth
Scientific notation5.116746 × 10^6
Engineering notation5.116746 × 10^6
In other bases
Ternary100121221212010base 3; the most digit-efficient integer base after e: 15 digits
Quinary2302213441base 5; one hand: 10 digits
Septenary61330425base 7: 8 digits
Nonary10557763base 9; each digit is two ternary digits: 8 digits
Duodecimal18690b6base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1bjbh6base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal23:41:19:6base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101T0T00T0TT010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100100001011101011110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010011100001001101001010
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 set bits, so even; 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
Bytes34e 13 4a
Gray code11010010001101011101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010011100001001101001010
64-bit0000000000000000000000000000000000000000010011100001001101001010
One's complement11111111101100011110110010110101at 32 bits, every bit flipped
Bits reversed01010010110010000111001000000000at 32 bits
Rotated left by 100000000100111000010011010010100at 32 bits, wrapping
Shifted left by 1100111000010011010010100= 10,233,492, no wrap
Shifted right by 11001110000100110100101= 2,558,373, discarding the low bit
These bits as a double2.52800842 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,116,746 to the power 226,181,089,628,516
5,116,746 to the power 3133,961,985,632,350,728,936
5,116,746 to the power 4685,449,454,136,388,062,880,362,256
5,116,746 to the power 53,507,270,752,654,547,075,190,842,051,938,976
First ten multiples5,116,746, 10,233,492, 15,350,238, 20,466,984, 25,583,730, 30,700,476, 35,817,222, 40,933,968, 46,050,714, 51,167,460
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6Yes
Divisible by 7No, remainder 5
Divisible by 8No, remainder 2
Divisible by 9No, remainder 3
Divisible by 10No, remainder 6
Divisible by 11No, remainder 8
Divisible by 12No, remainder 6
Divisible by 100No, remainder 46
Collatz (3n + 1) trajectory
Steps to reach 1281the total stopping time
Highest value reached11,829,0762× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,116,746 → 2,558,373 → 7,675,120 → 3,837,560 → 1,918,780 → 959,390 → 479,695 → 1,439,086 → 719,543 → 2,158,630 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage511,674,600%
5,116,746% as a decimal51,167.46
5,116,746% of 1005,116,746
5,116,746% of 1,00051,167,460
As a fraction of 1005,116,746/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 5,116,746
Nerdulate something else
Nothing in mind? Surprise me · today’s page