Recognised as Number
4,607,687
- Positive
- Odd
- Composite
- 7 digits
4,607,687 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,607,687
Digit count7
Digit sum38
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 71 × 73 × 127
Distinct prime factors47, 71, 73, 127
Number of divisors16
Sum of divisors σ(n)5,455,872
Aliquot sum848,185sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,810,240integers below n that share no factor with it
Carmichael function λ(n)2,520the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,810,240
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 71, 73, 127, 497, 511, 889, 5,183, 9,017, 9,271, 36,281, 63,119, 64,897, 658,241, 4,607,68716 in total
Arithmetic
Previous number4,607,686
Next number4,607,688
Double9,215,374
Half2,303,843.5
Square21,230,779,489,969
Cube97,824,786,655,796,791,703
Square root2,146.552352029≈irrational, shown to 9 decimal places
Cube root166.402938014≈
Negation-4,607,687
Reciprocal2.17028631 × 10^-7≈
Representations
Decimal4,607,687
Binary1000110010011101100011123 bits
Octal21447307
Hexadecimal464EC7
Base 362QRBB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, six hundred and seven thousand, six hundred and eighty-seven
Ordinalfour million, six hundred and seven thousand, six hundred and eighty-seventh
Scientific notation4.607687 × 10^6
Engineering notation4.607687 × 10^6
In other bases
Ternary22200002120002base 3; the most digit-efficient integer base after e: 14 digits
Quinary2134421222base 5; one hand: 10 digits
Septenary54110330base 7: 8 digits
Nonary8602502base 9; each digit is two ternary digits: 7 digits
Duodecimal166259bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal18fj47base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:19:54:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T00010TT001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110100101001111011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010001100100111011000111
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
Bytes346 4e c7
Gray code11001010110100110100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010001100100111011000111
64-bit0000000000000000000000000000000000000000010001100100111011000111
One's complement11111111101110011011000100111000at 32 bits, every bit flipped
Bits reversed11100011011100100110001000000000at 32 bits
Rotated left by 100000000100011001001110110001110at 32 bits, wrapping
Shifted left by 1100011001001110110001110= 9,215,374, no wrap
Shifted right by 11000110010011101100011= 2,303,843, discarding the low bit
These bits as a double2.27649985 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,607,687 to the power 221,230,779,489,969
4,607,687 to the power 397,824,786,655,796,791,703
4,607,687 to the power 4450,745,997,751,688,351,771,620,961
4,607,687 to the power 52,076,896,474,142,483,646,509,524,870,927,207
First ten multiples4,607,687, 9,215,374, 13,823,061, 18,430,748, 23,038,435, 27,646,122, 32,253,809, 36,861,496, 41,469,183, 46,076,870
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 1100the total stopping time
Highest value reached31,101,8926× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,607,687 → 13,823,062 → 6,911,531 → 20,734,594 → 10,367,297 → 31,101,892 → 15,550,946 → 7,775,473 → 23,326,420 → 11,663,210 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage460,768,700%
4,607,687% as a decimal46,076.87
4,607,687% of 1004,607,687
4,607,687% of 1,00046,076,870
As a fraction of 1004,607,687/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,607,687
Nerdulate something else
Nothing in mind? Surprise me · today’s page