Recognised as Number
5,672,593
- Positive
- Odd
- Composite
- 7 digits
5,672,593 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value5,672,593
Digit count7
Digit sum37
Digit product56,700
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 factorisation89 × 63,737
Distinct prime factors289, 63,737
Number of divisors4
Sum of divisors σ(n)5,736,420
Aliquot sum63,827sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,608,768integers below n that share no factor with it
Carmichael function λ(n)701,096the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,608,768
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 89, 63,737, 5,672,5934 in total
Arithmetic
Previous number5,672,592
Next number5,672,594
Double11,345,186
Half2,836,296.5
Square32,178,311,343,649
Cube182,534,463,679,803,911,857
Square root2,381.720596544≈irrational, shown to 9 decimal places
Cube root178.344837138≈
Negation-5,672,593
Reciprocal1.76286224 × 10^-7≈
Representations
Decimal5,672,593
Binary1010110100011101001000123 bits
Octal25507221
Hexadecimal568E91
Base 363DL01
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, six hundred and seventy-two thousand, five hundred and ninety-three
Ordinalfive million, six hundred and seventy-two thousand, five hundred and ninety-third
Scientific notation5.672593 × 10^6
Engineering notation5.672593 × 10^6
In other bases
Ternary101200012100001base 3; the most digit-efficient integer base after e: 15 digits
Quinary2423010333base 5; one hand: 10 digits
Septenary66134113base 7: 8 digits
Nonary11605301base 9; each digit is two ternary digits: 8 digits
Duodecimal1a96901base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1f919dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal26:15:43:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11TT001TT100001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010111001001110010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010101101000111010010001
Bit length23 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits12within that length
Bit parityodd11 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
Bytes356 8e 91
Gray code11111011100100111011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010101101000111010010001
64-bit0000000000000000000000000000000000000000010101101000111010010001
One's complement11111111101010010111000101101110at 32 bits, every bit flipped
Bits reversed10001001011100010110101000000000at 32 bits
Rotated left by 100000000101011010001110100100010at 32 bits, wrapping
Shifted left by 1101011010001110100100010= 11,345,186, no wrap
Shifted right by 11010110100011101001000= 2,836,296, discarding the low bit
These bits as a double2.80263332 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,672,593 to the power 232,178,311,343,649
5,672,593 to the power 3182,534,463,679,803,911,857
5,672,593 to the power 41,035,443,720,928,809,911,772,635,201
5,672,593 to the power 55,873,650,803,234,720,603,852,068,032,746,193
First ten multiples5,672,593, 11,345,186, 17,017,779, 22,690,372, 28,362,965, 34,035,558, 39,708,151, 45,380,744, 51,053,337, 56,725,930
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 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 93
Collatz (3n + 1) trajectory
Steps to reach 1108the total stopping time
Highest value reached17,017,7803× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,672,593 → 17,017,780 → 8,508,890 → 4,254,445 → 12,763,336 → 6,381,668 → 3,190,834 → 1,595,417 → 4,786,252 → 2,393,126 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage567,259,300%
5,672,593% as a decimal56,725.93
5,672,593% of 1005,672,593
5,672,593% of 1,00056,725,930
As a fraction of 1005,672,593/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,672,593
Nerdulate something else
Nothing in mind? Surprise me · today’s page