Recognised as Number
5,617,421
- Positive
- Odd
- Prime
- 7 digits
5,617,421 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value5,617,421
Digit count7
Digit sum26
Digit product1,680
Multiplicative persistence2times 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 factorisation5,617,421
Distinct prime factors15,617,421
Number of divisors2
Sum of divisors σ(n)5,617,422
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,617,420integers below n that share no factor with it
Carmichael function λ(n)5,617,420the 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,617,4212 in total
Arithmetic
Previous number5,617,420
Next number5,617,422
Double11,234,842
Half2,808,710.5
Square31,555,418,691,241
Cube177,260,071,619,969,709,461
Square root2,370.109913063≈irrational, shown to 9 decimal places
Cube root177.764754674≈
Negation-5,617,421
Reciprocal1.78017635 × 10^-7≈
Representations
Decimal5,617,421
Binary1010101101101110000110123 bits
Octal25333415
Hexadecimal55B70D
Base 363CEFH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, six hundred and seventeen thousand, four hundred and twenty-one
Ordinalfive million, six hundred and seventeen thousand, four hundred and twenty-first
Scientific notation5.617421 × 10^6
Engineering notation5.617421 × 10^6
In other bases
Ternary101120101122122base 3; the most digit-efficient integer base after e: 15 digits
Quinary2414224141base 5; one hand: 10 digits
Septenary65514215base 7: 8 digits
Nonary11511578base 9; each digit is two ternary digits: 8 digits
Duodecimal1a6a9a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1f23b1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal26:0:23:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11TTT011TT00T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010101100101100011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010101011011011100001101
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 odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes355 b7 0d
Gray code11111110110110010001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010101011011011100001101
64-bit0000000000000000000000000000000000000000010101011011011100001101
One's complement11111111101010100100100011110010at 32 bits, every bit flipped
Bits reversed10110000111011011010101000000000at 32 bits
Rotated left by 100000000101010110110111000011010at 32 bits, wrapping
Shifted left by 1101010110110111000011010= 11,234,842, no wrap
Shifted right by 11010101101101110000110= 2,808,710, discarding the low bit
These bits as a double2.77537473 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,617,421 to the power 231,555,418,691,241
5,617,421 to the power 3177,260,071,619,969,709,461
5,617,421 to the power 4995,744,448,779,521,865,290,120,081
5,617,421 to the power 55,593,515,777,207,510,496,039,891,635,531,101
First ten multiples5,617,421, 11,234,842, 16,852,263, 22,469,684, 28,087,105, 33,704,526, 39,321,947, 44,939,368, 50,556,789, 56,174,210
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 21
Collatz (3n + 1) trajectory
Steps to reach 1170the total stopping time
Highest value reached16,852,2643× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,617,421 → 16,852,264 → 8,426,132 → 4,213,066 → 2,106,533 → 6,319,600 → 3,159,800 → 1,579,900 → 789,950 → 394,975 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage561,742,100%
5,617,421% as a decimal56,174.21
5,617,421% of 1005,617,421
5,617,421% of 1,00056,174,210
As a fraction of 1005,617,421/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,617,421
Nerdulate something else
Nothing in mind? Surprise me · today’s page