Recognised as Number
3,390,563
- Positive
- Odd
- Composite
- 7 digits
3,390,563 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,390,563
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation11 × 31 × 61 × 163
Distinct prime factors411, 31, 61, 163
Number of divisors16
Sum of divisors σ(n)3,904,512
Aliquot sum513,949sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,916,000integers below n that share no factor with it
Carmichael function λ(n)1,620the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,916,000
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 31, 61, 163, 341, 671, 1,793, 1,891, 5,053, 9,943, 20,801, 55,583, 109,373, 308,233, 3,390,56316 in total
Arithmetic
Previous number3,390,562
Next number3,390,564
Double6,781,126
Half1,695,281.5
Square11,495,917,456,969
Cube38,977,632,380,653,183,547
Square root1,841.348147418≈irrational, shown to 9 decimal places
Cube root150.230209473≈
Negation-3,390,563
Reciprocal2.94936269 × 10^-7≈
Representations
Decimal3,390,563
Binary110011101111000110001122 bits
Octal14736143
Hexadecimal33BC63
Base 3620O6B
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and ninety thousand, five hundred and sixty-three
Ordinalthree million, three hundred and ninety thousand, five hundred and sixty-third
Scientific notation3.390563 × 10^6
Engineering notation3.390563 × 10^6
In other bases
Ternary20101020222102base 3; the most digit-efficient integer base after e: 14 digits
Quinary1331444223base 5; one hand: 10 digits
Septenary40551011base 7: 8 digits
Nonary6336872base 9; each digit is two ternary digits: 7 digits
Duodecimal117616bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal113g83base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:41:49:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01011T100T11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001100110110100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100111011110001100011
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 set bits, so odd; 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
Bytes333 bc 63
Gray code1010100110001001010010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100111011110001100011
64-bit0000000000000000000000000000000000000000001100111011110001100011
One's complement11111111110011000100001110011100at 32 bits, every bit flipped
Bits reversed11000110001111011100110000000000at 32 bits
Rotated left by 100000000011001110111100011000110at 32 bits, wrapping
Shifted left by 111001110111100011000110= 6,781,126, no wrap
Shifted right by 1110011101111000110001= 1,695,281, discarding the low bit
These bits as a double1.6751607 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,390,563 to the power 211,495,917,456,969
3,390,563 to the power 338,977,632,380,653,183,547
3,390,563 to the power 4132,156,118,177,444,599,966,666,961
3,390,563 to the power 5448,083,644,516,071,095,196,782,231,289,043
First ten multiples3,390,563, 6,781,126, 10,171,689, 13,562,252, 16,952,815, 20,343,378, 23,733,941, 27,124,504, 30,515,067, 33,905,630
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11Yes
Divisible by 12No, remainder 11
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1159the total stopping time
Highest value reached15,257,5364× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,390,563 → 10,171,690 → 5,085,845 → 15,257,536 → 7,628,768 → 3,814,384 → 1,907,192 → 953,596 → 476,798 → 238,399 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage339,056,300%
3,390,563% as a decimal33,905.63
3,390,563% of 1003,390,563
3,390,563% of 1,00033,905,630
As a fraction of 1003,390,563/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,390,563
Nerdulate something else
Nothing in mind? Surprise me · today’s page