Recognised as Number
5,324,590
- Positive
- Even
- Composite
- 7 digits
5,324,590 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value5,324,590
Digit count7
Digit sum28
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 factorisation2 × 5 × 709 × 751
Distinct prime factors42, 5, 709, 751
Number of divisors16
Sum of divisors σ(n)9,610,560
Aliquot sum4,285,970sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,124,000integers below n that share no factor with it
Carmichael function λ(n)88,500the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,124,000
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 709, 751, 1,418, 1,502, 3,545, 3,755, 7,090, 7,510, 532,459, 1,064,918, 2,662,295, 5,324,59016 in total
Arithmetic
Previous number5,324,589
Next number5,324,591
Double10,649,180
Half2,662,295
Square28,351,258,668,100
Cube150,958,828,391,578,579,000
Square root2,307.507313098≈irrational, shown to 9 decimal places
Cube root174.620565662≈
Negation-5,324,590
Reciprocal1.87807888 × 10^-7≈
Representations
Decimal5,324,590
Binary1010001001111110010111023 bits
Octal24237456
Hexadecimal513F2E
Base 36364HA
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, three hundred and twenty-four thousand, five hundred and ninety
Ordinalfive million, three hundred and twenty-four thousand, five hundred and ninetieth
Scientific notation5.32459 × 10^6
Engineering notation5.32459 × 10^6
In other bases
Ternary101000111222001base 3; the most digit-efficient integer base after e: 15 digits
Quinary2330341330base 5; one hand: 10 digits
Septenary63154405base 7: 8 digits
Nonary11014861base 9; each digit is two ternary digits: 8 digits
Duodecimal194943abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1d5b9abase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal24:39:3:10base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101001TTT00T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100010100001101110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010100010011111100101110
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 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
Bytes351 3f 2e
Gray code11110011010000010111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010100010011111100101110
64-bit0000000000000000000000000000000000000000010100010011111100101110
One's complement11111111101011101100000011010001at 32 bits, every bit flipped
Bits reversed01110100111111001000101000000000at 32 bits
Rotated left by 100000000101000100111111001011100at 32 bits, wrapping
Shifted left by 1101000100111111001011100= 10,649,180, no wrap
Shifted right by 11010001001111110010111= 2,662,295, discarding the low bit
These bits as a double2.630697 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,324,590 to the power 228,351,258,668,100
5,324,590 to the power 3150,958,828,391,578,579,000
5,324,590 to the power 4803,793,868,065,515,385,957,610,000
5,324,590 to the power 54,279,872,791,962,962,568,916,030,629,900,000
First ten multiples5,324,590, 10,649,180, 15,973,770, 21,298,360, 26,622,950, 31,947,540, 37,272,130, 42,596,720, 47,921,310, 53,245,900
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 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 5
Divisible by 8No, remainder 6
Divisible by 9No, remainder 1
Divisible by 10Yes
Divisible by 11No, remainder 7
Divisible by 12No, remainder 10
Divisible by 100No, remainder 90
Collatz (3n + 1) trajectory
Steps to reach 1157the total stopping time
Highest value reached17,970,4963× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,324,590 → 2,662,295 → 7,986,886 → 3,993,443 → 11,980,330 → 5,990,165 → 17,970,496 → 8,985,248 → 4,492,624 → 2,246,312 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage532,459,000%
5,324,590% as a decimal53,245.9
5,324,590% of 1005,324,590
5,324,590% of 1,00053,245,900
As a fraction of 1005,324,590/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 5,324,590
Nerdulate something else
Nothing in mind? Surprise me · today’s page