Nerdulator> put something in

Recognised as Number

6,652,001

  • Positive
  • Odd
  • Prime
  • 7 digits

6,652,001 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 value6,652,001
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 factorisation6,652,001
Distinct prime factors16,652,001
Number of divisors2
Sum of divisors σ(n)6,652,002
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,652,000integers below n that share no factor with it
Carmichael function λ(n)6,652,000the 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, 6,652,0012 in total

Arithmetic

Previous number6,652,000
Next number6,652,002
Cube294,345,172,555,331,956,001
Square root2,579.147339723≈irrational, shown to 9 decimal places
Cube root188.069095245≈
Negation-6,652,001
Reciprocal1.50330705 × 10^-7≈

Representations

Decimal6,652,001
Binary1100101100000000110000123 bits
Octal31300141
Hexadecimal658061
Base 363YKPT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, six hundred and fifty-two thousand and one
Ordinalsix million, six hundred and fifty-two thousand and first
Scientific notation6.652001 × 10^6
Engineering notation6.652001 × 10^6

In other bases

Ternary110111221211102base 3; the most digit-efficient integer base after e: 15 digits
Quinary3200331001base 5; one hand: 10 digits
Septenary110353406base 7: 9 digits
Nonary13457742base 9; each digit is two ternary digits: 8 digits
Duodecimal2289655base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal21ba01base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal30:47:46:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111TTT00TT1111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101110101000000110100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000011001011000000001100001
Bit length23 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits15within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes365 80 61
Gray code10101110100000001010001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000011001011000000001100001
64-bit0000000000000000000000000000000000000000011001011000000001100001
One's complement11111111100110100111111110011110at 32 bits, every bit flipped
Bits reversed10000110000000011010011000000000at 32 bits
Rotated left by 100000000110010110000000011000010at 32 bits, wrapping
Shifted left by 1110010110000000011000010= 13,304,002, no wrap
Shifted right by 11100101100000000110000= 3,326,000, discarding the low bit
These bits as a double3.28652517 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime6,652,021+20
Previous prime6,651,959−42
Distance to nearest prime0, it is prime
Nearest square below6,651,241
Nearest square above6,656,400

Powers & multiples

6,652,001 to the power 244,249,117,304,001
6,652,001 to the power 3294,345,172,555,331,956,001
6,652,001 to the power 41,957,984,382,183,240,726,650,608,001
6,652,001 to the power 513,024,514,068,267,299,496,920,571,073,260,001
First ten multiples6,652,001, 13,304,002, 19,956,003, 26,608,004, 33,260,005, 39,912,006, 46,564,007, 53,216,008, 59,868,009, 66,520,010
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

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 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1103the total stopping time
Highest value reached40,456,5646× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,652,001 → 19,956,004 → 9,978,002 → 4,989,001 → 14,967,004 → 7,483,502 → 3,741,751 → 11,225,254 → 5,612,627 → 16,837,882 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage665,200,100%
6,652,001% as a decimal66,520.01
6,652,001% of 1006,652,001
6,652,001% of 1,00066,520,010
As a fraction of 1006,652,001/100

Read another way

As bytes6.344 MiB
As a 24-bit colour#658061

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