Recognised as Number
3,498,592
- Positive
- Even
- Composite
- 7 digits
3,498,592 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,498,592
Digit count7
Digit sum40
Digit product77,760
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^5 × 109,331
Distinct prime factors22, 109,331
Number of divisors12
Sum of divisors σ(n)6,887,916
Aliquot sum3,389,324sum 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)437,320the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,749,280
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 109,331, 218,662, 437,324, 874,648, 1,749,296, 3,498,59212 in total
Arithmetic
Previous number3,498,591
Next number3,498,593
Double6,997,184
Half1,749,296
Square12,240,145,982,464
Cube42,823,276,813,080,690,688
Square root1,870.452351705≈irrational, shown to 9 decimal places
Cube root151.809086257≈
Negation-3,498,592
Reciprocal2.85829271 × 10^-7≈
Representations
Decimal3,498,592
Binary110101011000100110000022 bits
Octal15261140
Hexadecimal356260
Base 3622ZJ4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and ninety-eight thousand, five hundred and ninety-two
Ordinalthree million, four hundred and ninety-eight thousand, five hundred and ninety-second
Scientific notation3.498592 × 10^6
Engineering notation3.498592 × 10^6
In other bases
Ternary20120202011111base 3; the most digit-efficient integer base after e: 14 digits
Quinary1343423332base 5; one hand: 10 digits
Septenary41510656base 7: 8 digits
Nonary6522144base 9; each digit is two ternary digits: 7 digits
Duodecimal1208794base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11h69cbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:11:49:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT1T1T011111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010101010011110100000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010110001001100000
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 55 trailing zeros
Power of twoNo
Bytes335 62 60
Gray code1011111101001101010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010110001001100000
64-bit0000000000000000000000000000000000000000001101010110001001100000
One's complement11111111110010101001110110011111at 32 bits, every bit flipped
Bits reversed00000110010001101010110000000000at 32 bits
Rotated left by 100000000011010101100010011000000at 32 bits, wrapping
Shifted left by 111010101100010011000000= 6,997,184, no wrap
Shifted right by 1110101011000100110000= 1,749,296, discarding the low bit
These bits as a double1.72853412 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,498,592 to the power 212,240,145,982,464
3,498,592 to the power 342,823,276,813,080,690,688
3,498,592 to the power 4149,821,173,672,029,599,795,511,296
3,498,592 to the power 5524,163,159,639,573,381,607,777,456,095,232
First ten multiples3,498,592, 6,997,184, 10,495,776, 13,994,368, 17,492,960, 20,991,552, 24,490,144, 27,988,736, 31,487,328, 34,985,920
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 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 4
Divisible by 10No, remainder 2
Divisible by 11No, remainder 9
Divisible by 12No, remainder 4
Divisible by 100No, remainder 92
Collatz (3n + 1) trajectory
Steps to reach 1190the total stopping time
Highest value reached3,498,592
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,498,592 → 1,749,296 → 874,648 → 437,324 → 218,662 → 109,331 → 327,994 → 163,997 → 491,992 → 245,996 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage349,859,200%
3,498,592% as a decimal34,985.92
3,498,592% of 1003,498,592
3,498,592% of 1,00034,985,920
As a fraction of 1003,498,592/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,592
Nerdulate something else
Nothing in mind? Surprise me · today’s page