Recognised as Number
4,679,059
- Positive
- Odd
- Composite
- 7 digits
4,679,059 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,679,059
Digit count7
Digit sum40
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7^2 × 11 × 8,681
Distinct prime factors37, 11, 8,681
Number of divisors12
Sum of divisors σ(n)5,938,488
Aliquot sum1,259,429sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,645,600integers below n that share no factor with it
Carmichael function λ(n)26,040the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,645,600
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 7, 11, 49, 77, 539, 8,681, 60,767, 95,491, 425,369, 668,437, 4,679,05912 in total
Arithmetic
Previous number4,679,058
Next number4,679,060
Double9,358,118
Half2,339,529.5
Square21,893,593,125,481
Cube102,441,413,956,120,002,379
Square root2,163.113265643≈irrational, shown to 9 decimal places
Cube root167.257720565≈
Negation-4,679,059
Reciprocal2.13718186 × 10^-7≈
Representations
Decimal4,679,059
Binary1000111011001011001001123 bits
Octal21662623
Hexadecimal476593
Base 362SADV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, six hundred and seventy-nine thousand and fifty-nine
Ordinalfour million, six hundred and seventy-nine thousand and fifty-ninth
Scientific notation4.679059 × 10^6
Engineering notation4.679059 × 10^6
In other bases
Ternary22210201110111base 3; the most digit-efficient integer base after e: 14 digits
Quinary2144212214base 5; one hand: 10 digits
Septenary54525400base 7: 8 digits
Nonary8721414base 9; each digit is two ternary digits: 7 digits
Duodecimal1697957base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal194hcjbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:39:44:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T11T01110111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110001011101010010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010001110110010110010011
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 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
Bytes347 65 93
Gray code11001001101011101011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010001110110010110010011
64-bit0000000000000000000000000000000000000000010001110110010110010011
One's complement11111111101110001001101001101100at 32 bits, every bit flipped
Bits reversed11001001101001101110001000000000at 32 bits
Rotated left by 100000000100011101100101100100110at 32 bits, wrapping
Shifted left by 1100011101100101100100110= 9,358,118, no wrap
Shifted right by 11000111011001011001001= 2,339,529, discarding the low bit
These bits as a double2.31176231 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,679,059 to the power 221,893,593,125,481
4,679,059 to the power 3102,441,413,956,120,002,379
4,679,059 to the power 4479,329,419,944,108,902,211,481,361
4,679,059 to the power 52,242,810,636,354,262,255,872,751,765,519,299
First ten multiples4,679,059, 9,358,118, 14,037,177, 18,716,236, 23,395,295, 28,074,354, 32,753,413, 37,432,472, 42,111,531, 46,790,590
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11Yes
Divisible by 12No, remainder 7
Divisible by 100No, remainder 59
Collatz (3n + 1) trajectory
Steps to reach 1162the total stopping time
Highest value reached21,055,7684× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,679,059 → 14,037,178 → 7,018,589 → 21,055,768 → 10,527,884 → 5,263,942 → 2,631,971 → 7,895,914 → 3,947,957 → 11,843,872 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage467,905,900%
4,679,059% as a decimal46,790.59
4,679,059% of 1004,679,059
4,679,059% of 1,00046,790,590
As a fraction of 1004,679,059/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,679,059
Nerdulate something else
Nothing in mind? Surprise me · today’s page