Recognised as Number
5,573,413
- Positive
- Odd
- Prime
- 7 digits
5,573,413 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 value5,573,413
Digit count7
Digit sum28
Digit product6,300
Multiplicative persistence2times 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 factorisation5,573,413
Distinct prime factors15,573,413
Number of divisors2
Sum of divisors σ(n)5,573,414
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,573,412integers below n that share no factor with it
Carmichael function λ(n)5,573,412the 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, 5,573,4132 in total
Arithmetic
Previous number5,573,412
Next number5,573,414
Double11,146,826
Half2,786,706.5
Square31,062,932,468,569
Cube173,126,551,638,444,555,997
Square root2,360.807700767≈irrational, shown to 9 decimal places
Cube root177.299322235≈
Negation-5,573,413
Reciprocal1.79423273 × 10^-7≈
Representations
Decimal5,573,413
Binary1010101000010110010010123 bits
Octal25205445
Hexadecimal550B25
Base 363BGH1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, five hundred and seventy-three thousand, four hundred and thirteen
Ordinalfive million, five hundred and seventy-three thousand, four hundred and thirteenth
Scientific notation5.573413 × 10^6
Engineering notation5.573413 × 10^6
In other bases
Ternary101111011021201base 3; the most digit-efficient integer base after e: 15 digits
Quinary2411322123base 5; one hand: 10 digits
Septenary65242006base 7: 8 digits
Nonary11434251base 9; each digit is two ternary digits: 8 digits
Duodecimal1a49431base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1egdadbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal25:48:10:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10111101110TT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101010001111101100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010101010000101100100101
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 odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes355 0b 25
Gray code11111111000111010110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010101010000101100100101
64-bit0000000000000000000000000000000000000000010101010000101100100101
One's complement11111111101010101111010011011010at 32 bits, every bit flipped
Bits reversed10100100110100001010101000000000at 32 bits
Rotated left by 100000000101010100001011001001010at 32 bits, wrapping
Shifted left by 1101010100001011001001010= 11,146,826, no wrap
Shifted right by 11010101000010110010010= 2,786,706, discarding the low bit
These bits as a double2.75363189 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,573,413 to the power 231,062,932,468,569
5,573,413 to the power 3173,126,551,638,444,555,997
5,573,413 to the power 4964,905,773,546,878,188,172,907,761
5,573,413 to the power 55,377,818,382,061,227,003,379,330,362,958,293
First ten multiples5,573,413, 11,146,826, 16,720,239, 22,293,652, 27,867,065, 33,440,478, 39,013,891, 44,587,304, 50,160,717, 55,734,130
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1201the total stopping time
Highest value reached16,720,2403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,573,413 → 16,720,240 → 8,360,120 → 4,180,060 → 2,090,030 → 1,045,015 → 3,135,046 → 1,567,523 → 4,702,570 → 2,351,285 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage557,341,300%
5,573,413% as a decimal55,734.13
5,573,413% of 1005,573,413
5,573,413% of 1,00055,734,130
As a fraction of 1005,573,413/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,573,413
Nerdulate something else
Nothing in mind? Surprise me · today’s page