Recognised as Number
3,553,293
- Positive
- Odd
- Composite
- 7 digits
3,553,293 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,553,293
Digit count7
Digit sum30
Digit product12,150
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 23^2 × 2,239
Distinct prime factors33, 23, 2,239
Number of divisors12
Sum of divisors σ(n)4,954,880
Aliquot sum1,401,587sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,264,856integers below n that share no factor with it
Carmichael function λ(n)566,214the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,264,856
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 23, 69, 529, 1,587, 2,239, 6,717, 51,497, 154,491, 1,184,431, 3,553,29312 in total
Arithmetic
Previous number3,553,292
Next number3,553,294
Double7,106,586
Half1,776,646.5
Square12,625,891,143,849
Cube44,863,490,620,200,644,757
Square root1,885.018037049≈irrational, shown to 9 decimal places
Cube root152.59618406≈
Negation-3,553,293
Reciprocal2.81429086 × 10^-7≈
Representations
Decimal3,553,293
Binary110110001110000000110122 bits
Octal15434015
Hexadecimal36380D
Base 36245QL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and fifty-three thousand, two hundred and ninety-three
Ordinalthree million, five hundred and fifty-three thousand, two hundred and ninety-third
Scientific notation3.553293 × 10^6
Engineering notation3.553293 × 10^6
In other bases
Ternary20200112012110base 3; the most digit-efficient integer base after e: 14 digits
Quinary1402201133base 5; one hand: 10 digits
Septenary42126312base 7: 8 digits
Nonary6615173base 9; each digit is two ternary digits: 7 digits
Duodecimal1234379base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12434dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:27:1:33base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T01TTT1TT110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010100100100000011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101100011100000001101
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 38 0d
Gray code1011010010010000001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101100011100000001101
64-bit0000000000000000000000000000000000000000001101100011100000001101
One's complement11111111110010011100011111110010at 32 bits, every bit flipped
Bits reversed10110000000111000110110000000000at 32 bits
Rotated left by 100000000011011000111000000011010at 32 bits, wrapping
Shifted left by 111011000111000000011010= 7,106,586, no wrap
Shifted right by 1110110001110000000110= 1,776,646, discarding the low bit
These bits as a double1.75556 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,553,293 to the power 212,625,891,143,849
3,553,293 to the power 344,863,490,620,200,644,757
3,553,293 to the power 4159,413,127,176,324,609,610,534,801
3,553,293 to the power 5566,441,548,903,744,001,056,846,034,649,693
First ten multiples3,553,293, 7,106,586, 10,659,879, 14,213,172, 17,766,465, 21,319,758, 24,873,051, 28,426,344, 31,979,637, 35,532,930
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 9
Divisible by 100No, remainder 93
Collatz (3n + 1) trajectory
Steps to reach 197the total stopping time
Highest value reached10,659,8803× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,553,293 → 10,659,880 → 5,329,940 → 2,664,970 → 1,332,485 → 3,997,456 → 1,998,728 → 999,364 → 499,682 → 249,841 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage355,329,300%
3,553,293% as a decimal35,532.93
3,553,293% of 1003,553,293
3,553,293% of 1,00035,532,930
As a fraction of 1003,553,293/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,553,293
Nerdulate something else
Nothing in mind? Surprise me · today’s page