Recognised as Number
3,498,531
- Positive
- Odd
- Composite
- 7 digits
3,498,531 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,498,531
Digit count7
Digit sum33
Digit product12,960
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 29 × 40,213
Distinct prime factors33, 29, 40,213
Number of divisors8
Sum of divisors σ(n)4,825,680
Aliquot sum1,327,149sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,251,872integers below n that share no factor with it
Carmichael function λ(n)281,484the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,251,872
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 29, 87, 40,213, 120,639, 1,166,177, 3,498,5318 in total
Arithmetic
Previous number3,498,530
Next number3,498,532
Double6,997,062
Half1,749,265.5
Square12,239,719,157,961
Cube42,821,036,905,420,455,291
Square root1,870.436045418≈irrational, shown to 9 decimal places
Cube root151.808203958≈
Negation-3,498,531
Reciprocal2.85834254 × 10^-7≈
Representations
Decimal3,498,531
Binary110101011000100010001122 bits
Octal15261043
Hexadecimal356223
Base 3622ZHF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and ninety-eight thousand, five hundred and thirty-one
Ordinalthree million, four hundred and ninety-eight thousand, five hundred and thirty-first
Scientific notation3.498531 × 10^6
Engineering notation3.498531 × 10^6
In other bases
Ternary20120202002020base 3; the most digit-efficient integer base after e: 14 digits
Quinary1343423111base 5; one hand: 10 digits
Septenary41510541base 7: 8 digits
Nonary6522066base 9; each digit is two ternary digits: 7 digits
Duodecimal1208743base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11h66bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:11:48:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT1T1T01T1T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010101010011001100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010110001000100011
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 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 23
Gray code1011111101001100110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010110001000100011
64-bit0000000000000000000000000000000000000000001101010110001000100011
One's complement11111111110010101001110111011100at 32 bits, every bit flipped
Bits reversed11000100010001101010110000000000at 32 bits
Rotated left by 100000000011010101100010001000110at 32 bits, wrapping
Shifted left by 111010101100010001000110= 6,997,062, no wrap
Shifted right by 1110101011000100010001= 1,749,265, discarding the low bit
These bits as a double1.72850398 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,498,531 to the power 212,239,719,157,961
3,498,531 to the power 342,821,036,905,420,455,291
3,498,531 to the power 4149,810,725,065,757,530,869,677,521
3,498,531 to the power 5524,117,465,775,029,760,231,023,767,221,651
First ten multiples3,498,531, 6,997,062, 10,495,593, 13,994,124, 17,492,655, 20,991,186, 24,489,717, 27,988,248, 31,486,779, 34,985,310
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 3
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1190the total stopping time
Highest value reached15,743,3924× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,498,531 → 10,495,594 → 5,247,797 → 15,743,392 → 7,871,696 → 3,935,848 → 1,967,924 → 983,962 → 491,981 → 1,475,944 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage349,853,100%
3,498,531% as a decimal34,985.31
3,498,531% of 1003,498,531
3,498,531% of 1,00034,985,310
As a fraction of 1003,498,531/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,531
Nerdulate something else
Nothing in mind? Surprise me · today’s page