Recognised as Number
3,552,389
- Positive
- Odd
- Composite
- 7 digits
3,552,389 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,552,389
Digit count7
Digit sum35
Digit product32,400
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 factorisation1,567 × 2,267
Distinct prime factors21,567, 2,267
Number of divisors4
Sum of divisors σ(n)3,556,224
Aliquot sum3,835sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,548,556integers below n that share no factor with it
Carmichael function λ(n)1,774,278the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,548,556
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,567, 2,267, 3,552,3894 in total
Arithmetic
Previous number3,552,388
Next number3,552,390
Double7,104,778
Half1,776,194.5
Square12,619,467,607,321
Cube44,829,257,914,103,439,869
Square root1,884.778236292≈irrational, shown to 9 decimal places
Cube root152.583242201≈
Negation-3,552,389
Reciprocal2.81500703 × 10^-7≈
Representations
Decimal3,552,389
Binary110110001101001000010122 bits
Octal15432205
Hexadecimal363485
Base 362451H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and fifty-two thousand, three hundred and eighty-nine
Ordinalthree million, five hundred and fifty-two thousand, three hundred and eighty-ninth
Scientific notation3.552389 × 10^6
Engineering notation3.552389 × 10^6
In other bases
Ternary20200110221222base 3; the most digit-efficient integer base after e: 14 digits
Quinary1402134024base 5; one hand: 10 digits
Septenary42123551base 7: 8 digits
Nonary6613858base 9; each digit is two ternary digits: 7 digits
Duodecimal1233945base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1240j9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:26:46:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T0011100T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010100111010110000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101100011010010000101
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes336 34 85
Gray code1011010010111011000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101100011010010000101
64-bit0000000000000000000000000000000000000000001101100011010010000101
One's complement11111111110010011100101101111010at 32 bits, every bit flipped
Bits reversed10100001001011000110110000000000at 32 bits
Rotated left by 100000000011011000110100100001010at 32 bits, wrapping
Shifted left by 111011000110100100001010= 7,104,778, no wrap
Shifted right by 1110110001101001000010= 1,776,194, discarding the low bit
These bits as a double1.75511337 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,552,389 to the power 212,619,467,607,321
3,552,389 to the power 344,829,257,914,103,439,869
3,552,389 to the power 4159,250,962,692,224,004,652,797,041
3,552,389 to the power 5565,721,368,107,266,939,664,545,027,680,949
First ten multiples3,552,389, 7,104,778, 10,657,167, 14,209,556, 17,761,945, 21,314,334, 24,866,723, 28,419,112, 31,971,501, 35,523,890
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1159the total stopping time
Highest value reached10,657,1683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,552,389 → 10,657,168 → 5,328,584 → 2,664,292 → 1,332,146 → 666,073 → 1,998,220 → 999,110 → 499,555 → 1,498,666 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage355,238,900%
3,552,389% as a decimal35,523.89
3,552,389% of 1003,552,389
3,552,389% of 1,00035,523,890
As a fraction of 1003,552,389/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 3,552,389
Nerdulate something else
Nothing in mind? Surprise me · today’s page