Recognised as Number
3,498,599
- Positive
- Odd
- Composite
- 7 digits
3,498,599 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,498,599
Digit count7
Digit sum47
Digit product349,920
Multiplicative persistence2times 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 factorisation13 × 23 × 11,701
Distinct prime factors313, 23, 11,701
Number of divisors8
Sum of divisors σ(n)3,931,872
Aliquot sum433,273sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,088,800integers below n that share no factor with it
Carmichael function λ(n)128,700the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,088,800
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 23, 299, 11,701, 152,113, 269,123, 3,498,5998 in total
Arithmetic
Previous number3,498,598
Next number3,498,600
Double6,997,198
Half1,749,299.5
Square12,240,194,962,801
Cube42,823,533,856,660,615,799
Square root1,870.45422291≈irrational, shown to 9 decimal places
Cube root151.809187504≈
Negation-3,498,599
Reciprocal2.85828699 × 10^-7≈
Representations
Decimal3,498,599
Binary110101011000100110011122 bits
Octal15261147
Hexadecimal356267
Base 3622ZJB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and ninety-eight thousand, five hundred and ninety-nine
Ordinalthree million, four hundred and ninety-eight thousand, five hundred and ninety-ninth
Scientific notation3.498599 × 10^6
Engineering notation3.498599 × 10^6
In other bases
Ternary20120202011202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1343423344base 5; one hand: 10 digits
Septenary41510666base 7: 8 digits
Nonary6522152base 9; each digit is two ternary digits: 7 digits
Duodecimal120879bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11h69jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:11:49:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT1T1T1TTT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010101010011110111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010110001001100111
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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
Bytes335 62 67
Gray code1011111101001101010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010110001001100111
64-bit0000000000000000000000000000000000000000001101010110001001100111
One's complement11111111110010101001110110011000at 32 bits, every bit flipped
Bits reversed11100110010001101010110000000000at 32 bits
Rotated left by 100000000011010101100010011001110at 32 bits, wrapping
Shifted left by 111010101100010011001110= 6,997,198, no wrap
Shifted right by 1110101011000100110011= 1,749,299, discarding the low bit
These bits as a double1.72853757 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,498,599 to the power 212,240,194,962,801
3,498,599 to the power 342,823,533,856,660,615,799
3,498,599 to the power 4149,822,372,727,378,973,773,765,601
3,498,599 to the power 5524,168,403,401,635,350,265,922,557,892,999
First ten multiples3,498,599, 6,997,198, 10,495,797, 13,994,396, 17,492,995, 20,991,594, 24,490,193, 27,988,792, 31,487,391, 34,985,990
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 11
Divisible by 100No, remainder 99
Collatz (3n + 1) trajectory
Steps to reach 1190the total stopping time
Highest value reached59,776,86417× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,498,599 → 10,495,798 → 5,247,899 → 15,743,698 → 7,871,849 → 23,615,548 → 11,807,774 → 5,903,887 → 17,711,662 → 8,855,831 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage349,859,900%
3,498,599% as a decimal34,985.99
3,498,599% of 1003,498,599
3,498,599% of 1,00034,985,990
As a fraction of 1003,498,599/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,599
Nerdulate something else
Nothing in mind? Surprise me · today’s page