Recognised as Number
5,477,382
- Positive
- Even
- Composite
- 7 digits
5,477,382 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value5,477,382
Digit count7
Digit sum36
Digit product47,040
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3^4 × 33,811
Distinct prime factors32, 3, 33,811
Number of divisors20
Sum of divisors σ(n)12,273,756
Aliquot sum6,796,374sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,825,740integers below n that share no factor with it
Carmichael function λ(n)304,290the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,825,740
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 18, 27, 54, 81, 162, 33,811, 67,622, 101,433, 202,866, 304,299, 608,598, 912,897, 1,825,794, 2,738,691, 5,477,38220 in total
Arithmetic
Previous number5,477,381
Next number5,477,383
Double10,954,764
Half2,738,691
Square30,001,713,573,924
Cube164,330,845,898,966,986,968
Square root2,340.380738256≈irrational, shown to 9 decimal places
Cube root176.275116384≈
Negation-5,477,382
Reciprocal1.82568972 × 10^-7≈
Representations
Decimal5,477,382
Binary1010011100101000000011023 bits
Octal24712006
Hexadecimal539406
Base 3639EDI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, four hundred and seventy-seven thousand, three hundred and eighty-two
Ordinalfive million, four hundred and seventy-seven thousand, three hundred and eighty-second
Scientific notation5.477382 × 10^6
Engineering notation5.477382 × 10^6
In other bases
Ternary101022021120000base 3; the most digit-efficient integer base after e: 15 digits
Quinary2400234012base 5; one hand: 10 digits
Septenary64362021base 7: 8 digits
Nonary11267500base 9; each digit is two ternary digits: 8 digits
Duodecimal1a01946base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1e4d92base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal25:21:29:42base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10110T10TTT0000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101001001010000011010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010100111001010000000110
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
Bytes353 94 06
Gray code11110100101111000000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010100111001010000000110
64-bit0000000000000000000000000000000000000000010100111001010000000110
One's complement11111111101011000110101111111001at 32 bits, every bit flipped
Bits reversed01100000001010011100101000000000at 32 bits
Rotated left by 100000000101001110010100000001100at 32 bits, wrapping
Shifted left by 1101001110010100000001100= 10,954,764, no wrap
Shifted right by 11010011100101000000011= 2,738,691, discarding the low bit
These bits as a double2.70618628 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,477,382 to the power 230,001,713,573,924
5,477,382 to the power 3164,330,845,898,966,986,968
5,477,382 to the power 4900,102,817,371,775,593,012,757,776
5,477,382 to the power 54,930,206,970,021,450,941,207,405,212,622,432
First ten multiples5,477,382, 10,954,764, 16,432,146, 21,909,528, 27,386,910, 32,864,292, 38,341,674, 43,819,056, 49,296,438, 54,773,820
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 1
Divisible by 8No, remainder 6
Divisible by 9Yes
Divisible by 10No, remainder 2
Divisible by 11No, remainder 9
Divisible by 12No, remainder 6
Divisible by 100No, remainder 82
Collatz (3n + 1) trajectory
Steps to reach 1170the total stopping time
Highest value reached12,324,1122× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,477,382 → 2,738,691 → 8,216,074 → 4,108,037 → 12,324,112 → 6,162,056 → 3,081,028 → 1,540,514 → 770,257 → 2,310,772 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage547,738,200%
5,477,382% as a decimal54,773.82
5,477,382% of 1005,477,382
5,477,382% of 1,00054,773,820
As a fraction of 1005,477,382/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,477,382
Nerdulate something else
Nothing in mind? Surprise me · today’s page