Recognised as Number
5,590,195
- Positive
- Odd
- Composite
- 7 digits
5,590,195 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value5,590,195
Digit count7
Digit sum34
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 13 × 17 × 5,059
Distinct prime factors45, 13, 17, 5,059
Number of divisors16
Sum of divisors σ(n)7,650,720
Aliquot sum2,060,525sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,884,544integers below n that share no factor with it
Carmichael function λ(n)40,464the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,884,544
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 13, 17, 65, 85, 221, 1,105, 5,059, 25,295, 65,767, 86,003, 328,835, 430,015, 1,118,039, 5,590,19516 in total
Arithmetic
Previous number5,590,194
Next number5,590,196
Double11,180,390
Half2,795,097.5
Square31,250,280,138,025
Cube174,695,159,776,186,664,875
Square root2,364.359321254≈irrational, shown to 9 decimal places
Cube root177.47709815≈
Negation-5,590,195
Reciprocal1.78884636 × 10^-7≈
Representations
Decimal5,590,195
Binary1010101010011001011001123 bits
Octal25246263
Hexadecimal554CB3
Base 363BTF7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, five hundred and ninety thousand, one hundred and ninety-five
Ordinalfive million, five hundred and ninety thousand, one hundred and ninety-fifth
Scientific notation5.590195 × 10^6
Engineering notation5.590195 × 10^6
In other bases
Ternary101112000022021base 3; the most digit-efficient integer base after e: 15 digits
Quinary2412341240base 5; one hand: 10 digits
Septenary65341642base 7: 8 digits
Nonary11460267base 9; each digit is two ternary digits: 8 digits
Duodecimal1a57097base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1eif9fbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal25:52:49:55base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11TTTT00010T1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101010101110111110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010101010100110010110011
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 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 4c b3
Gray code11111111110101011101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010101010100110010110011
64-bit0000000000000000000000000000000000000000010101010100110010110011
One's complement11111111101010101011001101001100at 32 bits, every bit flipped
Bits reversed11001101001100101010101000000000at 32 bits
Rotated left by 100000000101010101001100101100110at 32 bits, wrapping
Shifted left by 1101010101001100101100110= 11,180,390, no wrap
Shifted right by 11010101010011001011001= 2,795,097, discarding the low bit
These bits as a double2.7619233 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,590,195 to the power 231,250,280,138,025
5,590,195 to the power 3174,695,159,776,186,664,875
5,590,195 to the power 4976,580,008,705,039,813,050,900,625
5,590,195 to the power 55,459,272,681,762,870,037,718,079,419,371,875
First ten multiples5,590,195, 11,180,390, 16,770,585, 22,360,780, 27,950,975, 33,541,170, 39,131,365, 44,721,560, 50,311,755, 55,901,950
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 3
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 5
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 95
Collatz (3n + 1) trajectory
Steps to reach 1201the total stopping time
Highest value reached25,155,8804× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,590,195 → 16,770,586 → 8,385,293 → 25,155,880 → 12,577,940 → 6,288,970 → 3,144,485 → 9,433,456 → 4,716,728 → 2,358,364 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage559,019,500%
5,590,195% as a decimal55,901.95
5,590,195% of 1005,590,195
5,590,195% of 1,00055,901,950
As a fraction of 1005,590,195/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,195
Nerdulate something else
Nothing in mind? Surprise me · today’s page