Nerdulator> put something in

Recognised as Number

3,263,489

  • Positive
  • Odd
  • Prime
  • 7 digits

3,263,489 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,263,489
Digit count7
Digit sum35
Digit product31,104
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3,263,489
Distinct prime factors13,263,489
Number of divisors2
Sum of divisors σ(n)3,263,490
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,263,488integers below n that share no factor with it
Carmichael function λ(n)3,263,488the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3,263,4892 in total

Arithmetic

Previous number3,263,488
Next number3,263,490
Double6,526,978
Cube34,757,334,184,795,399,169
Square root1,806.512939339≈irrational, shown to 9 decimal places
Cube root148.329449322≈
Negation-3,263,489
Reciprocal3.06420521 × 10^-7≈

Representations

Decimal3,263,489
Binary110001110011000000000122 bits
Octal14346001
Hexadecimal31CC01
Base 361XY4H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, two hundred and sixty-three thousand, four hundred and eighty-nine
Ordinalthree million, two hundred and sixty-three thousand, four hundred and eighty-ninth
Scientific notation3.263489 × 10^6
Engineering notation3.263489 × 10^6

In other bases

Ternary20010210122222base 3; the most digit-efficient integer base after e: 14 digits
Quinary1313412424base 5; one hand: 10 digits
Septenary36511355base 7: 8 digits
Nonary6123588base 9; each digit is two ternary digits: 7 digits
Duodecimal1114715base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal107ie9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:6:31:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0011T11T0000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101101101110000000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001100011100110000000001
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 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
Bytes331 cc 01
Gray code1010010010101000000001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001100011100110000000001
64-bit0000000000000000000000000000000000000000001100011100110000000001
One's complement11111111110011100011001111111110at 32 bits, every bit flipped
Bits reversed10000000001100111000110000000000at 32 bits
Rotated left by 100000000011000111001100000000010at 32 bits, wrapping
Shifted left by 111000111001100000000010= 6,526,978, no wrap
Shifted right by 1110001110011000000000= 1,631,744, discarding the low bit
These bits as a double1.6123778 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,263,501+12
Previous prime3,263,483−6
Distance to nearest prime0, it is prime
Nearest square below3,261,636
Nearest square above3,265,249

Powers & multiples

3,263,489 to the power 210,650,360,453,121
3,263,489 to the power 334,757,334,184,795,399,169
3,263,489 to the power 4113,430,177,781,403,752,438,640,641
3,263,489 to the power 5370,178,137,457,655,550,642,226,906,856,449
First ten multiples3,263,489, 6,526,978, 9,790,467, 13,053,956, 16,317,445, 19,580,934, 22,844,423, 26,107,912, 29,371,401, 32,634,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 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 89

Collatz (3n + 1) trajectory

Steps to reach 1208the total stopping time
Highest value reached9,790,4683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,263,489 → 9,790,468 → 4,895,234 → 2,447,617 → 7,342,852 → 3,671,426 → 1,835,713 → 5,507,140 → 2,753,570 → 1,376,785 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage326,348,900%
3,263,489% as a decimal32,634.89
3,263,489% of 1003,263,489
3,263,489% of 1,00032,634,890
As a fraction of 1003,263,489/100

Read another way

As bytes3.112 MiB
As a 24-bit colour#31CC01

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “3263489” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.