Recognised as Number
3,485,489
- Positive
- Odd
- Composite
- 7 digits
3,485,489 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,485,489
Digit count7
Digit sum41
Digit product138,240
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 23 × 21,649
Distinct prime factors37, 23, 21,649
Number of divisors8
Sum of divisors σ(n)4,156,800
Aliquot sum671,311sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,857,536integers below n that share no factor with it
Carmichael function λ(n)21,648the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,857,536
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 23, 161, 21,649, 151,543, 497,927, 3,485,4898 in total
Arithmetic
Previous number3,485,488
Next number3,485,490
Double6,970,978
Half1,742,744.5
Square12,148,633,569,121
Cube42,343,928,670,201,985,169
Square root1,866.946437368≈irrational, shown to 9 decimal places
Cube root151.619329643≈
Negation-3,485,489
Reciprocal2.86903789 × 10^-7≈
Representations
Decimal3,485,489
Binary110101001011110011000122 bits
Octal15227461
Hexadecimal352F31
Base 3622PF5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and eighty-five thousand, four hundred and eighty-nine
Ordinalthree million, four hundred and eighty-five thousand, four hundred and eighty-ninth
Scientific notation3.485489 × 10^6
Engineering notation3.485489 × 10^6
In other bases
Ternary20120002012012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1343013424base 5; one hand: 10 digits
Septenary41424530base 7: 8 digits
Nonary6502165base 9; each digit is two ternary digits: 7 digits
Duodecimal1201095base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11fde9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:8:11:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT001T1TT1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101010111001101110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010010111100110001
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 2f 31
Gray code1011111011100010101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010010111100110001
64-bit0000000000000000000000000000000000000000001101010010111100110001
One's complement11111111110010101101000011001110at 32 bits, every bit flipped
Bits reversed10001100111101001010110000000000at 32 bits
Rotated left by 100000000011010100101111001100010at 32 bits, wrapping
Shifted left by 111010100101111001100010= 6,970,978, no wrap
Shifted right by 1110101001011110011000= 1,742,744, discarding the low bit
These bits as a double1.72206037 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,485,489 to the power 212,148,633,569,121
3,485,489 to the power 342,343,928,670,201,985,169
3,485,489 to the power 4147,589,297,596,773,647,084,712,641
3,485,489 to the power 5514,420,873,291,280,982,403,647,978,366,449
First ten multiples3,485,489, 6,970,978, 10,456,467, 13,941,956, 17,427,445, 20,912,934, 24,398,423, 27,883,912, 31,369,401, 34,854,890
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1102the total stopping time
Highest value reached10,456,4683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,485,489 → 10,456,468 → 5,228,234 → 2,614,117 → 7,842,352 → 3,921,176 → 1,960,588 → 980,294 → 490,147 → 1,470,442 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage348,548,900%
3,485,489% as a decimal34,854.89
3,485,489% of 1003,485,489
3,485,489% of 1,00034,854,890
As a fraction of 1003,485,489/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,485,489
Nerdulate something else
Nothing in mind? Surprise me · today’s page