Recognised as Number
3,606,947
- Positive
- Odd
- Prime
- 7 digits
3,606,947 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,606,947
Digit count7
Digit sum35
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,606,947
Distinct prime factors13,606,947
Number of divisors2
Sum of divisors σ(n)3,606,948
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,606,946integers below n that share no factor with it
Carmichael function λ(n)3,606,946the 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,606,9472 in total
Arithmetic
Previous number3,606,946
Next number3,606,948
Double7,213,894
Half1,803,473.5
Square13,010,066,660,809
Cube46,926,620,912,005,040,123
Square root1,899.196409011≈irrational, shown to 9 decimal places
Cube root153.360407423≈
Negation-3,606,947
Reciprocal2.77242776 × 10^-7≈
Representations
Decimal3,606,947
Binary110111000010011010001122 bits
Octal15604643
Hexadecimal3709A3
Base 3625B4Z
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and six thousand, nine hundred and forty-seven
Ordinalthree million, six hundred and six thousand, nine hundred and forty-seventh
Scientific notation3.606947 × 10^6
Engineering notation3.606947 × 10^6
In other bases
Ternary20210020210122base 3; the most digit-efficient integer base after e: 14 digits
Quinary1410410242base 5; one hand: 10 digits
Septenary42441611base 7: 8 digits
Nonary6706718base 9; each digit is two ternary digits: 7 digits
Duodecimal125b42bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12ah77base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:41:55:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T101T1T11T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110001111011100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110000100110100011
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 set bits, so odd; 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
Bytes337 09 a3
Gray code1011001000110101110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110000100110100011
64-bit0000000000000000000000000000000000000000001101110000100110100011
One's complement11111111110010001111011001011100at 32 bits, every bit flipped
Bits reversed11000101100100001110110000000000at 32 bits
Rotated left by 100000000011011100001001101000110at 32 bits, wrapping
Shifted left by 111011100001001101000110= 7,213,894, no wrap
Shifted right by 1110111000010011010001= 1,803,473, discarding the low bit
These bits as a double1.7820686 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,606,947 to the power 213,010,066,660,809
3,606,947 to the power 346,926,620,912,005,040,123
3,606,947 to the power 4169,261,834,518,693,843,456,534,481
3,606,947 to the power 5610,518,466,231,699,202,574,016,676,639,507
First ten multiples3,606,947, 7,213,894, 10,820,841, 14,427,788, 18,034,735, 21,641,682, 25,248,629, 28,855,576, 32,462,523, 36,069,470
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 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1177the total stopping time
Highest value reached21,107,2845× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,606,947 → 10,820,842 → 5,410,421 → 16,231,264 → 8,115,632 → 4,057,816 → 2,028,908 → 1,014,454 → 507,227 → 1,521,682 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage360,694,700%
3,606,947% as a decimal36,069.47
3,606,947% of 1003,606,947
3,606,947% of 1,00036,069,470
As a fraction of 1003,606,947/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 3,606,947
Nerdulate something else
Nothing in mind? Surprise me · today’s page