Nerdulator> put something in

Recognised as Number

3,263,501

  • Positive
  • Odd
  • Prime
  • 7 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,263,501
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation3,263,501
Distinct prime factors13,263,501
Number of divisors2
Sum of divisors σ(n)3,263,502
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,263,500integers below n that share no factor with it
Carmichael function λ(n)3,263,500the 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,5012 in total

Arithmetic

Previous number3,263,500
Next number3,263,502
Double6,527,002
Cube34,757,717,599,181,540,501
Square root1,806.516260652≈irrational, shown to 9 decimal places
Cube root148.329631127≈
Negation-3,263,501
Reciprocal3.06419394 × 10^-7≈

Representations

Decimal3,263,501
Binary110001110011000000110122 bits
Octal14346015
Hexadecimal31CC0D
Base 361XY4T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, two hundred and sixty-three thousand, five hundred and one
Ordinalthree million, two hundred and sixty-three thousand, five hundred and first
Scientific notation3.263501 × 10^6
Engineering notation3.263501 × 10^6

In other bases

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

Bit-level

00000000001100011100110000001101
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
Bytes331 cc 0d
Gray code1010010010101000001011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001100011100110000001101
64-bit0000000000000000000000000000000000000000001100011100110000001101
One's complement11111111110011100011001111110010at 32 bits, every bit flipped
Bits reversed10110000001100111000110000000000at 32 bits
Rotated left by 100000000011000111001100000011010at 32 bits, wrapping
Shifted left by 111000111001100000011010= 6,527,002, no wrap
Shifted right by 1110001110011000000110= 1,631,750, discarding the low bit
These bits as a double1.61238373 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,263,509+8
Previous prime3,263,489−12
Distance to nearest prime0, it is prime
Nearest square below3,261,636
Nearest square above3,265,249

Powers & multiples

3,263,501 to the power 210,650,438,777,001
3,263,501 to the power 334,757,717,599,181,540,501
3,263,501 to the power 4113,431,846,142,646,556,606,554,001
3,263,501 to the power 5370,184,943,318,373,180,132,045,588,817,501
First ten multiples3,263,501, 6,527,002, 9,790,503, 13,054,004, 16,317,505, 19,581,006, 22,844,507, 26,108,008, 29,371,509, 32,635,010
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1208the total stopping time
Highest value reached9,790,5043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,263,501 → 9,790,504 → 4,895,252 → 2,447,626 → 1,223,813 → 3,671,440 → 1,835,720 → 917,860 → 458,930 → 229,465 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage326,350,100%
3,263,501% as a decimal32,635.01
3,263,501% of 1003,263,501
3,263,501% of 1,00032,635,010
As a fraction of 1003,263,501/100

Read another way

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

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 “3263501” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.