Nerdulator> put something in

Recognised as Number

3,532,007

  • Positive
  • Odd
  • Prime
  • 7 digits

3,532,007 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,532,007
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,532,007
Distinct prime factors13,532,007
Number of divisors2
Sum of divisors σ(n)3,532,008
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,532,006integers below n that share no factor with it
Carmichael function λ(n)3,532,006the 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,532,0072 in total

Arithmetic

Previous number3,532,006
Next number3,532,008
Double7,064,014
Cube44,062,046,744,023,204,343
Square root1,879.363456067≈irrational, shown to 9 decimal places
Cube root152.290864451≈
Negation-3,532,007
Reciprocal2.83125147 × 10^-7≈

Representations

Decimal3,532,007
Binary110101111001001110011122 bits
Octal15362347
Hexadecimal35E4E7
Base 3623PBB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and thirty-two thousand and seven
Ordinalthree million, five hundred and thirty-two thousand and seventh
Scientific notation3.532007 × 10^6
Engineering notation3.532007 × 10^6

In other bases

Ternary20122110000002base 3; the most digit-efficient integer base after e: 14 digits
Quinary1401011012base 5; one hand: 10 digits
Septenary42010253base 7: 8 digits
Nonary6573002base 9; each digit is two ternary digits: 7 digits
Duodecimal1223b9bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal121a07base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:21:6:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T0T11000001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010100010010100111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001101011110010011100111
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 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 e4 e7
Gray code1011110001011010010100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001101011110010011100111
64-bit0000000000000000000000000000000000000000001101011110010011100111
One's complement11111111110010100001101100011000at 32 bits, every bit flipped
Bits reversed11100111001001111010110000000000at 32 bits
Rotated left by 100000000011010111100100111001110at 32 bits, wrapping
Shifted left by 111010111100100111001110= 7,064,014, no wrap
Shifted right by 1110101111001001110011= 1,766,003, discarding the low bit
These bits as a double1.74504332 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,532,019+12
Previous prime3,531,991−16
Distance to nearest prime0, it is prime
Nearest square below3,530,641
Nearest square above3,534,400

Powers & multiples

3,532,007 to the power 212,475,073,448,049
3,532,007 to the power 344,062,046,744,023,204,343
3,532,007 to the power 4155,627,457,534,217,165,901,906,401
3,532,007 to the power 5549,677,269,403,057,769,485,694,721,676,807
First ten multiples3,532,007, 7,064,014, 10,596,021, 14,128,028, 17,660,035, 21,192,042, 24,724,049, 28,256,056, 31,788,063, 35,320,070
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 11
Divisible by 100No, remainder 7

Collatz (3n + 1) trajectory

Steps to reach 1190the total stopping time
Highest value reached52,317,41214× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,532,007 → 10,596,022 → 5,298,011 → 15,894,034 → 7,947,017 → 23,841,052 → 11,920,526 → 5,960,263 → 17,880,790 → 8,940,395 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage353,200,700%
3,532,007% as a decimal35,320.07
3,532,007% of 1003,532,007
3,532,007% of 1,00035,320,070
As a fraction of 1003,532,007/100

Read another way

As bytes3.368 MiB
As a 24-bit colour#35E4E7

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