Nerdulator> put something in

Recognised as Number

3,266,001

  • Positive
  • Odd
  • Composite
  • 7 digits

3,266,001 is an odd 7-digit integer and a composite number. It has 20 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,266,001
Digit count7
Digit sum18
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^4 × 61 × 661
Distinct prime factors33, 61, 661
Number of divisors20
Sum of divisors σ(n)4,966,324
Aliquot sum1,700,323sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,138,400integers below n that share no factor with it
Carmichael function λ(n)5,940the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,138,400
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 61, 81, 183, 549, 661, 1,647, 1,983, 4,941, 5,949, 17,847, 40,321, 53,541, 120,963, 362,889, 1,088,667, 3,266,00120 in total

Arithmetic

Previous number3,266,000
Next number3,266,002
Double6,532,002
Cube34,837,657,096,277,798,001
Square root1,807.208067711≈irrational, shown to 9 decimal places
Cube root148.367497356≈
Negation-3,266,001
Reciprocal3.06184842 × 10^-7≈

Representations

Decimal3,266,001
Binary110001110101011101000122 bits
Octal14352721
Hexadecimal31D5D1
Base 361Y029
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, two hundred and sixty-six thousand and one
Ordinalthree million, two hundred and sixty-six thousand and first
Scientific notation3.266001 × 10^6
Engineering notation3.266001 × 10^6

In other bases

Ternary20010221010000base 3; the most digit-efficient integer base after e: 14 digits
Quinary1314003001base 5; one hand: 10 digits
Septenary36521604base 7: 8 digits
Nonary6127100base 9; each digit is two ternary digits: 7 digits
Duodecimal1116069base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal108501base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:7:13:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00110T1010000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101100010101011010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001100011101010111010001
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
Bytes331 d5 d1
Gray code1010010011111100111001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001100011101010111010001
64-bit0000000000000000000000000000000000000000001100011101010111010001
One's complement11111111110011100010101000101110at 32 bits, every bit flipped
Bits reversed10001011101010111000110000000000at 32 bits
Rotated left by 100000000011000111010101110100010at 32 bits, wrapping
Shifted left by 111000111010101110100010= 6,532,002, no wrap
Shifted right by 1110001110101011101000= 1,633,000, discarding the low bit
These bits as a double1.61361889 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,266,041+40
Previous prime3,265,993−8
Distance to nearest prime8
Nearest square below3,265,249
Nearest square above3,268,864

Powers & multiples

3,266,001 to the power 210,666,762,532,001
3,266,001 to the power 334,837,657,096,277,798,001
3,266,001 to the power 4113,779,822,914,100,384,549,064,001
3,266,001 to the power 5371,605,015,417,274,770,037,627,576,330,001
First ten multiples3,266,001, 6,532,002, 9,798,003, 13,064,004, 16,330,005, 19,596,006, 22,862,007, 26,128,008, 29,394,009, 32,660,010
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1115the total stopping time
Highest value reached9,798,0043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,266,001 → 9,798,004 → 4,899,002 → 2,449,501 → 7,348,504 → 3,674,252 → 1,837,126 → 918,563 → 2,755,690 → 1,377,845 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage326,600,100%
3,266,001% as a decimal32,660.01
3,266,001% of 1003,266,001
3,266,001% of 1,00032,660,010
As a fraction of 1003,266,001/100

Read another way

As bytes3.115 MiB
As a 24-bit colour#31D5D1

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