Recognised as Number
4,979,706
- Positive
- Even
- Composite
- 7 digits
4,979,706 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,979,706
Digit count7
Digit sum42
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 29 × 28,619
Distinct prime factors42, 3, 29, 28,619
Number of divisors16
Sum of divisors σ(n)10,303,200
Aliquot sum5,323,494sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,602,608integers below n that share no factor with it
Carmichael function λ(n)400,652the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,602,608
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 29, 58, 87, 174, 28,619, 57,238, 85,857, 171,714, 829,951, 1,659,902, 2,489,853, 4,979,70616 in total
Arithmetic
Previous number4,979,705
Next number4,979,707
Double9,959,412
Half2,489,853
Square24,797,471,846,436
Cube123,484,119,338,528,427,816
Square root2,231.525487195≈irrational, shown to 9 decimal places
Cube root170.765932615≈
Negation-4,979,706
Reciprocal2.00815068 × 10^-7≈
Representations
Decimal4,979,706
Binary1001011111110111111101023 bits
Octal22775772
Hexadecimal4BFBFA
Base 362YQD6
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, nine hundred and seventy-nine thousand, seven hundred and six
Ordinalfour million, nine hundred and seventy-nine thousand, seven hundred and sixth
Scientific notation4.979706 × 10^6
Engineering notation4.979706 × 10^6
In other bases
Ternary100100222212120base 3; the most digit-efficient integer base after e: 15 digits
Quinary2233322311base 5; one hand: 10 digits
Septenary60220044base 7: 8 digits
Nonary10328776base 9; each digit is two ternary digits: 8 digits
Duodecimal1801936base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1b2956base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal23:3:15:6base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1001010000T0TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111000000110000001110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010010111111101111111010
Bit length23 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits6within that length
Bit parityodd17 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 fb fa
Gray code11011100000011000000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010010111111101111111010
64-bit0000000000000000000000000000000000000000010010111111101111111010
One's complement11111111101101000000010000000101at 32 bits, every bit flipped
Bits reversed01011111110111111101001000000000at 32 bits
Rotated left by 100000000100101111111011111110100at 32 bits, wrapping
Shifted left by 1100101111111011111110100= 9,959,412, no wrap
Shifted right by 11001011111110111111101= 2,489,853, discarding the low bit
These bits as a double2.46030166 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,979,706 to the power 224,797,471,846,436
4,979,706 to the power 3123,484,119,338,528,427,816
4,979,706 to the power 4614,914,609,974,786,043,165,902,096
4,979,706 to the power 53,062,093,972,779,101,907,869,501,662,863,776
First ten multiples4,979,706, 9,959,412, 14,939,118, 19,918,824, 24,898,530, 29,878,236, 34,857,942, 39,837,648, 44,817,354, 49,797,060
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 4
Divisible by 8No, remainder 2
Divisible by 9No, remainder 6
Divisible by 10No, remainder 6
Divisible by 11No, remainder 6
Divisible by 12No, remainder 6
Divisible by 100No, remainder 6
Collatz (3n + 1) trajectory
Steps to reach 1144the total stopping time
Highest value reached21,270,7604× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,979,706 → 2,489,853 → 7,469,560 → 3,734,780 → 1,867,390 → 933,695 → 2,801,086 → 1,400,543 → 4,201,630 → 2,100,815 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage497,970,600%
4,979,706% as a decimal49,797.06
4,979,706% of 1004,979,706
4,979,706% of 1,00049,797,060
As a fraction of 1004,979,706/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,979,706
Nerdulate something else
Nothing in mind? Surprise me · today’s page