Recognised as Number
4,656,964
- Positive
- Even
- Composite
- Perfect square
- 7 digits
4,656,964 is an even 7-digit integer and a composite number. It has 27 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,656,964
Digit count7
Digit sum40
Digit product155,520
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 2,158²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 13^2 × 83^2
Distinct prime factors32, 13, 83
Number of divisors27
Sum of divisors σ(n)8,932,413
Aliquot sum4,275,449sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,123,472integers below n that share no factor with it
Carmichael function λ(n)530,868the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,123,472
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 13, 26, 52, 83, 166, 169, 332, 338, 676, 1,079, 2,158, 4,316, 6,889, 13,778, 14,027, 27,556, 28,054, 56,108, 89,557, 179,114, 358,228, 1,164,241, 2,328,482, 4,656,96427 in total
Arithmetic
Previous number4,656,963
Next number4,656,965
Double9,313,928
Half2,328,482
Square21,687,313,697,296
Cube100,997,039,145,014,369,344
Square root2,158exact
Cube root166.994035667≈
Negation-4,656,964
Reciprocal2.14732173 × 10^-7≈
Representations
Decimal4,656,964
Binary1000111000011110100010023 bits
Octal21607504
Hexadecimal470F44
Base 362RTC4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, six hundred and fifty-six thousand, nine hundred and sixty-four
Ordinalfour million, six hundred and fifty-six thousand, nine hundred and sixty-fourth
Scientific notation4.656964 × 10^6
Engineering notation4.656964 × 10^6
In other bases
Ternary22202121011011base 3; the most digit-efficient integer base after e: 14 digits
Quinary2143010324base 5; one hand: 10 digits
Septenary54404104base 7: 8 digits
Nonary8677134base 9; each digit is two ternary digits: 7 digits
Duodecimal1687004base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal192284base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:33:36:4base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T10TT1011011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110110001001101000100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010001110000111101000100
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 22 trailing zeros
Power of twoNo
Bytes347 0f 44
Gray code11001001000100011100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010001110000111101000100
64-bit0000000000000000000000000000000000000000010001110000111101000100
One's complement11111111101110001111000010111011at 32 bits, every bit flipped
Bits reversed00100010111100001110001000000000at 32 bits
Rotated left by 100000000100011100001111010001000at 32 bits, wrapping
Shifted left by 1100011100001111010001000= 9,313,928, no wrap
Shifted right by 11000111000011110100010= 2,328,482, discarding the low bit
These bits as a double2.30084593 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,656,964 to the power 221,687,313,697,296
4,656,964 to the power 3100,997,039,145,014,369,344
4,656,964 to the power 4470,339,575,404,922,697,517,711,616
4,656,964 to the power 52,190,354,470,436,010,425,122,872,358,093,824
First ten multiples4,656,964, 9,313,928, 13,970,892, 18,627,856, 23,284,820, 27,941,784, 32,598,748, 37,255,712, 41,912,676, 46,569,640
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10No, remainder 4
Divisible by 11No, remainder 4
Divisible by 12No, remainder 4
Divisible by 100No, remainder 64
Collatz (3n + 1) trajectory
Steps to reach 1162the total stopping time
Highest value reached4,656,964
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,656,964 → 2,328,482 → 1,164,241 → 3,492,724 → 1,746,362 → 873,181 → 2,619,544 → 1,309,772 → 654,886 → 327,443 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage465,696,400%
4,656,964% as a decimal46,569.64
4,656,964% of 1004,656,964
4,656,964% of 1,00046,569,640
As a fraction of 1004,656,964/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,656,964
Nerdulate something else
Nothing in mind? Surprise me · today’s page