Recognised as Number
4,604,689
- Positive
- Odd
- Prime
- 7 digits
4,604,689 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,604,689
Digit count7
Digit sum37
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,604,689
Distinct prime factors14,604,689
Number of divisors2
Sum of divisors σ(n)4,604,690
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,604,688integers below n that share no factor with it
Carmichael function λ(n)4,604,688the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 4,604,6892 in total
Arithmetic
Previous number4,604,688
Next number4,604,690
Double9,209,378
Half2,302,344.5
Square21,203,160,786,721
Cube97,633,961,239,845,534,769
Square root2,145.853909286≈irrational, shown to 9 decimal places
Cube root166.366840059≈
Negation-4,604,689
Reciprocal2.17169933 × 10^-7≈
Representations
Decimal4,604,689
Binary1000110010000110001000123 bits
Octal21441421
Hexadecimal464311
Base 362QP01
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, six hundred and four thousand, six hundred and eighty-nine
Ordinalfour million, six hundred and four thousand, six hundred and eighty-ninth
Scientific notation4.604689 × 10^6
Engineering notation4.604689 × 10^6
In other bases
Ternary22122221110001base 3; the most digit-efficient integer base after e: 14 digits
Quinary2134322224base 5; one hand: 10 digits
Septenary54065515base 7: 8 digits
Nonary8587401base 9; each digit is two ternary digits: 7 digits
Duodecimal1660901base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal18fbe9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:19:4:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T000T1110001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110100100011100010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010001100100001100010001
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
Bytes346 43 11
Gray code11001010110001010011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010001100100001100010001
64-bit0000000000000000000000000000000000000000010001100100001100010001
One's complement11111111101110011011110011101110at 32 bits, every bit flipped
Bits reversed10001000110000100110001000000000at 32 bits
Rotated left by 100000000100011001000011000100010at 32 bits, wrapping
Shifted left by 1100011001000011000100010= 9,209,378, no wrap
Shifted right by 11000110010000110001000= 2,302,344, discarding the low bit
These bits as a double2.27501864 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,604,689 to the power 221,203,160,786,721
4,604,689 to the power 397,633,961,239,845,534,769
4,604,689 to the power 4449,574,027,347,543,095,649,931,841
4,604,689 to the power 52,070,148,578,412,930,869,565,188,999,002,449
First ten multiples4,604,689, 9,209,378, 13,814,067, 18,418,756, 23,023,445, 27,628,134, 32,232,823, 36,837,512, 41,442,201, 46,046,890
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1224the total stopping time
Highest value reached13,814,0683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,604,689 → 13,814,068 → 6,907,034 → 3,453,517 → 10,360,552 → 5,180,276 → 2,590,138 → 1,295,069 → 3,885,208 → 1,942,604 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage460,468,900%
4,604,689% as a decimal46,046.89
4,604,689% of 1004,604,689
4,604,689% of 1,00046,046,890
As a fraction of 1004,604,689/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,604,689
Nerdulate something else
Nothing in mind? Surprise me · today’s page