Recognised as Number
3,498,529
- Positive
- Odd
- Composite
- 7 digits
3,498,529 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,498,529
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 factorisation461 × 7,589
Distinct prime factors2461, 7,589
Number of divisors4
Sum of divisors σ(n)3,506,580
Aliquot sum8,051sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,490,480integers below n that share no factor with it
Carmichael function λ(n)872,620the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,490,480
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 461, 7,589, 3,498,5294 in total
Arithmetic
Previous number3,498,528
Next number3,498,530
Double6,997,058
Half1,749,264.5
Square12,239,705,163,841
Cube42,820,963,467,147,489,889
Square root1,870.435510784≈irrational, shown to 9 decimal places
Cube root151.80817503≈
Negation-3,498,529
Reciprocal2.85834418 × 10^-7≈
Representations
Decimal3,498,529
Binary110101011000100010000122 bits
Octal15261041
Hexadecimal356221
Base 3622ZHD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and ninety-eight thousand, five hundred and twenty-nine
Ordinalthree million, four hundred and ninety-eight thousand, five hundred and twenty-ninth
Scientific notation3.498529 × 10^6
Engineering notation3.498529 × 10^6
In other bases
Ternary20120202002011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1343423104base 5; one hand: 10 digits
Septenary41510536base 7: 8 digits
Nonary6522064base 9; each digit is two ternary digits: 7 digits
Duodecimal1208741base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11h669base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:11:48:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT1T1T01T011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010101010011001100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010110001000100001
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 odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes335 62 21
Gray code1011111101001100110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010110001000100001
64-bit0000000000000000000000000000000000000000001101010110001000100001
One's complement11111111110010101001110111011110at 32 bits, every bit flipped
Bits reversed10000100010001101010110000000000at 32 bits
Rotated left by 100000000011010101100010001000010at 32 bits, wrapping
Shifted left by 111010101100010001000010= 6,997,058, no wrap
Shifted right by 1110101011000100010000= 1,749,264, discarding the low bit
These bits as a double1.72850299 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,498,529 to the power 212,239,705,163,841
3,498,529 to the power 342,820,963,467,147,489,889
3,498,529 to the power 4149,810,382,497,756,040,653,873,281
3,498,529 to the power 5524,115,967,669,491,943,152,754,635,903,649
First ten multiples3,498,529, 6,997,058, 10,495,587, 13,994,116, 17,492,645, 20,991,174, 24,489,703, 27,988,232, 31,486,761, 34,985,290
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 1146the total stopping time
Highest value reached10,495,5883× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,498,529 → 10,495,588 → 5,247,794 → 2,623,897 → 7,871,692 → 3,935,846 → 1,967,923 → 5,903,770 → 2,951,885 → 8,855,656 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage349,852,900%
3,498,529% as a decimal34,985.29
3,498,529% of 1003,498,529
3,498,529% of 1,00034,985,290
As a fraction of 1003,498,529/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,529
Nerdulate something else
Nothing in mind? Surprise me · today’s page