Recognised as Number
5,590,838
- Positive
- Even
- Composite
- 7 digits
5,590,838 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value5,590,838
Digit count7
Digit sum38
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 11 × 47 × 5,407
Distinct prime factors42, 11, 47, 5,407
Number of divisors16
Sum of divisors σ(n)9,345,024
Aliquot sum3,754,186sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,486,760integers below n that share no factor with it
Carmichael function λ(n)621,690the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,486,760
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 11, 22, 47, 94, 517, 1,034, 5,407, 10,814, 59,477, 118,954, 254,129, 508,258, 2,795,419, 5,590,83816 in total
Arithmetic
Previous number5,590,837
Next number5,590,839
Double11,181,676
Half2,795,419
Square31,257,469,542,244
Cube174,755,448,500,620,360,472
Square root2,364.495294984≈irrational, shown to 9 decimal places
Cube root177.483902527≈
Negation-5,590,838
Reciprocal1.78864063 × 10^-7≈
Representations
Decimal5,590,838
Binary1010101010011110011011023 bits
Octal25247466
Hexadecimal554F36
Base 363BTX2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, five hundred and ninety thousand, eight hundred and thirty-eight
Ordinalfive million, five hundred and ninety thousand, eight hundred and thirty-eighth
Scientific notation5.590838 × 10^6
Engineering notation5.590838 × 10^6
In other bases
Ternary101112001012002base 3; the most digit-efficient integer base after e: 15 digits
Quinary2412401323base 5; one hand: 10 digits
Septenary65343551base 7: 8 digits
Nonary11461162base 9; each digit is two ternary digits: 8 digits
Duodecimal1a57532base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1eih1ibase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal25:53:0:38base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11TTTT0011TT01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101010101001101001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010101010100111100110110
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
Bytes355 4f 36
Gray code11111111110100010101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010101010100111100110110
64-bit0000000000000000000000000000000000000000010101010100111100110110
One's complement11111111101010101011000011001001at 32 bits, every bit flipped
Bits reversed01101100111100101010101000000000at 32 bits
Rotated left by 100000000101010101001111001101100at 32 bits, wrapping
Shifted left by 1101010101001111001101100= 11,181,676, no wrap
Shifted right by 11010101010011110011011= 2,795,419, discarding the low bit
These bits as a double2.76224099 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,590,838 to the power 231,257,469,542,244
5,590,838 to the power 3174,755,448,500,620,360,472
5,590,838 to the power 4977,029,402,184,311,334,900,555,536
5,590,838 to the power 55,462,413,108,849,330,814,992,752,111,779,168
First ten multiples5,590,838, 11,181,676, 16,772,514, 22,363,352, 27,954,190, 33,545,028, 39,135,866, 44,726,704, 50,317,542, 55,908,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 1
Divisible by 8No, remainder 6
Divisible by 9No, remainder 2
Divisible by 10No, remainder 8
Divisible by 11Yes
Divisible by 12No, remainder 2
Divisible by 100No, remainder 38
Collatz (3n + 1) trajectory
Steps to reach 182the total stopping time
Highest value reached31,841,5845× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,590,838 → 2,795,419 → 8,386,258 → 4,193,129 → 12,579,388 → 6,289,694 → 3,144,847 → 9,434,542 → 4,717,271 → 14,151,814 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage559,083,800%
5,590,838% as a decimal55,908.38
5,590,838% of 1005,590,838
5,590,838% of 1,00055,908,380
As a fraction of 1005,590,838/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,590,838
Nerdulate something else
Nothing in mind? Surprise me · today’s page