Recognised as Number
5,393,221
- Positive
- Odd
- Composite
- 7 digits
5,393,221 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value5,393,221
Digit count7
Digit sum25
Digit product1,620
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation773 × 6,977
Distinct prime factors2773, 6,977
Number of divisors4
Sum of divisors σ(n)5,400,972
Aliquot sum7,751sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,385,472integers below n that share no factor with it
Carmichael function λ(n)1,346,368the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,385,472
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 773, 6,977, 5,393,2214 in total
Arithmetic
Previous number5,393,220
Next number5,393,222
Double10,786,442
Half2,696,610.5
Square29,086,832,754,841
Cube156,871,717,236,896,332,861
Square root2,322.330941102≈irrational, shown to 9 decimal places
Cube root175.367619046≈
Negation-5,393,221
Reciprocal1.85417953 × 10^-7≈
Representations
Decimal5,393,221
Binary1010010010010110100010123 bits
Octal24445505
Hexadecimal524B45
Base 3637LFP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, three hundred and ninety-three thousand, two hundred and twenty-one
Ordinalfive million, three hundred and ninety-three thousand, two hundred and twenty-first
Scientific notation5.393221 × 10^6
Engineering notation5.393221 × 10^6
In other bases
Ternary101011000002221base 3; the most digit-efficient integer base after e: 15 digits
Quinary2340040341base 5; one hand: 10 digits
Septenary63561451base 7: 8 digits
Nonary11130087base 9; each digit is two ternary digits: 8 digits
Duodecimal19810b1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1de311base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal24:58:7:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1010110000100T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101100101111101000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010100100100101101000101
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
Bytes352 4b 45
Gray code11110110110111011100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010100100100101101000101
64-bit0000000000000000000000000000000000000000010100100100101101000101
One's complement11111111101011011011010010111010at 32 bits, every bit flipped
Bits reversed10100010110100100100101000000000at 32 bits
Rotated left by 100000000101001001001011010001010at 32 bits, wrapping
Shifted left by 1101001001001011010001010= 10,786,442, no wrap
Shifted right by 11010010010010110100010= 2,696,610, discarding the low bit
These bits as a double2.66460522 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,393,221 to the power 229,086,832,754,841
5,393,221 to the power 3156,871,717,236,896,332,861
5,393,221 to the power 4846,043,839,708,091,277,208,935,281
5,393,221 to the power 54,562,901,403,234,311,746,160,051,145,130,101
First ten multiples5,393,221, 10,786,442, 16,179,663, 21,572,884, 26,966,105, 32,359,326, 37,752,547, 43,145,768, 48,538,989, 53,932,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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 21
Collatz (3n + 1) trajectory
Steps to reach 187the total stopping time
Highest value reached16,179,6643× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,393,221 → 16,179,664 → 8,089,832 → 4,044,916 → 2,022,458 → 1,011,229 → 3,033,688 → 1,516,844 → 758,422 → 379,211 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage539,322,100%
5,393,221% as a decimal53,932.21
5,393,221% of 1005,393,221
5,393,221% of 1,00053,932,210
As a fraction of 1005,393,221/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,393,221
Nerdulate something else
Nothing in mind? Surprise me · today’s page