Recognised as Number
4,590,638
- Positive
- Even
- Composite
- 7 digits
4,590,638 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,590,638
Digit count7
Digit sum35
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 13 × 383 × 461
Distinct prime factors42, 13, 383, 461
Number of divisors16
Sum of divisors σ(n)7,451,136
Aliquot sum2,860,498sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,108,640integers below n that share no factor with it
Carmichael function λ(n)263,580the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,108,640
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 13, 26, 383, 461, 766, 922, 4,979, 5,993, 9,958, 11,986, 176,563, 353,126, 2,295,319, 4,590,63816 in total
Arithmetic
Previous number4,590,637
Next number4,590,639
Double9,181,276
Half2,295,319
Square21,073,957,247,044
Cube96,742,908,948,655,574,072
Square root2,142.577419838≈irrational, shown to 9 decimal places
Cube root166.19744735≈
Negation-4,590,638
Reciprocal2.17834645 × 10^-7≈
Representations
Decimal4,590,638
Binary1000110000011000010111023 bits
Octal21406056
Hexadecimal460C2E
Base 362QE5Q
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, five hundred and ninety thousand, six hundred and thirty-eight
Ordinalfour million, five hundred and ninety thousand, six hundred and thirty-eighth
Scientific notation4.590638 × 10^6
Engineering notation4.590638 × 10^6
In other bases
Ternary22122020011122base 3; the most digit-efficient integer base after e: 14 digits
Quinary2133400023base 5; one hand: 10 digits
Septenary54006533base 7: 8 digits
Nonary8566148base 9; each digit is two ternary digits: 7 digits
Duodecimal1654752base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal18dgbibase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:15:10:38base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T0T1T01TTT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110100001110001110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010001100000110000101110
Bit length23 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits14within that length
Bit parityodd9 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
Bytes346 0c 2e
Gray code11001010000101000111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010001100000110000101110
64-bit0000000000000000000000000000000000000000010001100000110000101110
One's complement11111111101110011111001111010001at 32 bits, every bit flipped
Bits reversed01110100001100000110001000000000at 32 bits
Rotated left by 100000000100011000001100001011100at 32 bits, wrapping
Shifted left by 1100011000001100001011100= 9,181,276, no wrap
Shifted right by 11000110000011000010111= 2,295,319, discarding the low bit
These bits as a double2.26807653 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,590,638 to the power 221,073,957,247,044
4,590,638 to the power 396,742,908,948,655,574,072
4,590,638 to the power 4444,111,674,050,238,327,246,737,936
4,590,638 to the power 52,038,755,927,138,637,974,115,310,545,043,168
First ten multiples4,590,638, 9,181,276, 13,771,914, 18,362,552, 22,953,190, 27,543,828, 32,134,466, 36,725,104, 41,315,742, 45,906,380
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7No, remainder 3
Divisible by 8No, remainder 6
Divisible by 9No, remainder 8
Divisible by 10No, remainder 8
Divisible by 11No, remainder 8
Divisible by 12No, remainder 2
Divisible by 100No, remainder 38
Collatz (3n + 1) trajectory
Steps to reach 1100the total stopping time
Highest value reached15,493,4083× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,590,638 → 2,295,319 → 6,885,958 → 3,442,979 → 10,328,938 → 5,164,469 → 15,493,408 → 7,746,704 → 3,873,352 → 1,936,676 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage459,063,800%
4,590,638% as a decimal45,906.38
4,590,638% of 1004,590,638
4,590,638% of 1,00045,906,380
As a fraction of 1004,590,638/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,590,638
Nerdulate something else
Nothing in mind? Surprise me · today’s page