Recognised as Number
3,498,562
- Positive
- Even
- Composite
- 7 digits
3,498,562 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,498,562
Digit count7
Digit sum37
Digit product51,840
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 factorisation2 × 1,749,281
Distinct prime factors22, 1,749,281
Number of divisors4
Sum of divisors σ(n)5,247,846
Aliquot sum1,749,284sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,749,280integers below n that share no factor with it
Carmichael function λ(n)1,749,280the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 1,749,281, 3,498,5624 in total
Arithmetic
Previous number3,498,561
Next number3,498,563
Double6,997,124
Half1,749,281
Square12,239,936,067,844
Cube42,822,175,209,388,440,328
Square root1,870.444332238≈irrational, shown to 9 decimal places
Cube root151.808652341≈
Negation-3,498,562
Reciprocal2.85831722 × 10^-7≈
Representations
Decimal3,498,562
Binary110101011000100100001022 bits
Octal15261102
Hexadecimal356242
Base 3622ZIA
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and ninety-eight thousand, five hundred and sixty-two
Ordinalthree million, four hundred and ninety-eight thousand, five hundred and sixty-second
Scientific notation3.498562 × 10^6
Engineering notation3.498562 × 10^6
In other bases
Ternary20120202010101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1343423222base 5; one hand: 10 digits
Septenary41510614base 7: 8 digits
Nonary6522111base 9; each digit is two ternary digits: 7 digits
Duodecimal120876abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11h682base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:11:49:22base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT1T1T010101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010101010011001000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010110001001000010
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes335 62 42
Gray code1011111101001101100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010110001001000010
64-bit0000000000000000000000000000000000000000001101010110001001000010
One's complement11111111110010101001110110111101at 32 bits, every bit flipped
Bits reversed01000010010001101010110000000000at 32 bits
Rotated left by 100000000011010101100010010000100at 32 bits, wrapping
Shifted left by 111010101100010010000100= 6,997,124, no wrap
Shifted right by 1110101011000100100001= 1,749,281, discarding the low bit
These bits as a double1.72851929 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,498,562 to the power 212,239,936,067,844
3,498,562 to the power 342,822,175,209,388,440,328
3,498,562 to the power 4149,816,034,944,908,440,570,808,336
3,498,562 to the power 5524,140,686,848,928,763,660,288,353,612,832
First ten multiples3,498,562, 6,997,124, 10,495,686, 13,994,248, 17,492,810, 20,991,372, 24,489,934, 27,988,496, 31,487,058, 34,985,620
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10No, remainder 2
Divisible by 11No, remainder 1
Divisible by 12No, remainder 10
Divisible by 100No, remainder 62
Collatz (3n + 1) trajectory
Steps to reach 1190the total stopping time
Highest value reached5,247,8441× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,498,562 → 1,749,281 → 5,247,844 → 2,623,922 → 1,311,961 → 3,935,884 → 1,967,942 → 983,971 → 2,951,914 → 1,475,957 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage349,856,200%
3,498,562% as a decimal34,985.62
3,498,562% of 1003,498,562
3,498,562% of 1,00034,985,620
As a fraction of 1003,498,562/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,498,562
Nerdulate something else
Nothing in mind? Surprise me · today’s page